387 search results - page 18 / 78 » Towards in-place geometric algorithms and data structures |
107
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
In recent years, nonlinear dimensionality reduction (NLDR) techniques have attracted much attention in visual perception and many other areas of science. We propose an efficient al...
118
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
111
click to vote
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
114
click to vote
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
Traditional stereo algorithms either explicitly use the frontal parallel plane assumption by only considering position (zero-order) disparity when computing similarity measures of ...
GMP
2003
IEEE
15 years 5 months ago
2003
IEEE
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...