1728 search results - page 311 / 346 » The Accelerated Euclidean Algorithm |
108
click to vote
DIALM
2008
ACM
14 years 11 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
SODA
1992
ACM
14 years 11 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
BMCBI
2007
14 years 9 months ago
2007
Background: The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compa...
104
click to vote
BMCBI
2008
14 years 9 months ago
2008
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...