This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Three ways of computing the Hellinger distance between two discrete | |
probability distributions using NumPy and SciPy. | |
""" | |
import numpy as np | |
from scipy.linalg import norm | |
from scipy.spatial.distance import euclidean | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
% Copyright (c) 2010-2014, Lars Buitinck | |
% May be used, redistributed and modified under the terms of the | |
% GNU Lesser General Public License (LGPL), version 2.1 or later | |
% Heaps/priority queues in Erlang | |
% Heaps are data structures that return the entries inserted into them in | |
% sorted order. This makes them the data structure of choice for implementing | |
% priority queues, a central element of algorithms such as best-first/A* | |
% search and Kruskal's minimum-spanning-tree algorithm. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Nonogram/paint-by-numbers solver in SWI-Prolog. Uses CLP(FD), | |
* in particular the automaton/3 (finite-state/RE) constraint. | |
* Copyright 2011, 2014 Lars Buitinck | |
* Copyright 2014 Markus Triska | |
* Do with this code as you like, but don't remove the copyright notice. | |
*/ | |
:- use_module(library(clpfd)). |
NewerOlder