1728 search results - page 182 / 346 » The Accelerated Euclidean Algorithm |
159
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
132
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
120
click to vote
CAD
2007
Springer
15 years 3 months ago
2007
Springer
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
118
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
99
Voted
LCN
2007
IEEE
15 years 9 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 ...