233 search results - page 34 / 47 » An Investigation of Practical Approximate Nearest Neighbor A... |
201
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
COMPGEOM
1998
ACM
15 years 4 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
104
click to vote
JSS
2010
14 years 11 months ago
2010
This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay–tolerant wireless sensor networks (DTWSN). T...
3DPVT
2002
IEEE
15 years 5 months ago
2002
IEEE
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
103
Voted
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...