Sciweavers

2262 search results - page 9 / 453
» Points with large quadrant-depth
Sort
View
EICS
2009
ACM
15 years 2 months ago
Initial evaluation of a bare-hand interaction technique for large displays using a webcam
dTouch is a novel 3D pointing system that allows interaction with large displays from the use of a single webcam. An initial evaluation demonstrating the feasibility of our pointi...
Kelvin Cheng, Masahiro Takatsuka
COLT
2003
Springer
15 years 2 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
GD
2009
Springer
15 years 2 months ago
Drawing Hamiltonian Cycles with No Large Angles
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
Adrian Dumitrescu, János Pach, Géza ...
CG
2007
Springer
14 years 9 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
DATAMINE
2006
166views more  DATAMINE 2006»
14 years 9 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis