4761 search results - page 677 / 953 » Generalizing Boundary Points |
178
click to vote
ICVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
177
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
158
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
154
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
162
click to vote
MHCI
2009
Springer
16 years 1 months ago
2009
Springer
In this article we describe the Sweep-Shake system, a novel, low interaction cost approach to supporting the spontaneous discovery of geo-located information. By sweeping a mobile...