6365 search results - page 49 / 1273 » Fast Local Computation Algorithms |
108
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
100
click to vote
ICCSA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper presents a new fast and local method of 3D surface reconstruction for scattered data. The algorithm makes use of quasiinterpolants to compute the control point...
114
Voted
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
96
Voted
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors a...
119
Voted
ICDE
2011
IEEE
14 years 4 months ago
2011
IEEE
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...