477 search results - page 71 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
109
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
177
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...