2342 search results - page 157 / 469 » Sublinear geometric algorithms |
140
click to vote
COMPGEOM
2009
ACM
15 years 8 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...
138
Voted
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
This paper addresses the fundamental problem of computing stable medial representations of 3D shapes. We propose a spatially adaptive classification of geometric features that yi...
146
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
158
click to vote
TIP
2010
15 years 1 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
120
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...