1100 search results - page 108 / 220 » Approximate distance oracles |
102
Voted
DAM
2011
14 years 5 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
112
Voted
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
99
Voted
IPMI
2009
Springer
15 years 5 months ago
2009
Springer
In this paper, we present a manifold clustering method for the classification of fibers obtained from diffusion tensor images (DTI) of the human skeletal muscle. Using a linear ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
92
Voted
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Understanding link statistics in mobile ad hoc networks (MANETs) is essential to design adaptive routing protocols and achieve desired network performance. While much a...