255 search results - page 26 / 51 » An Efficient Euclidean Distance Transform |
LCN
2007
IEEE
15 years 4 months ago
2007
IEEE
—Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through “stepping stone” hosts. Most ...
103
click to vote
IM
2008
14 years 10 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
131
click to vote
STOC
1998
ACM
15 years 2 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ICCV
2003
IEEE
15 years 12 months ago
2003
IEEE
Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. For ease of implementation and efficiency consi...
120
click to vote
BIOINFORMATICS
2008
14 years 10 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...