1082 search results - page 43 / 217 » Approximation Algorithms for Spreading Points |
CCCG
2007
13 years 9 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
SIGGRAPH
1992
ACM
13 years 11 months ago
1992
ACM
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1; : : : ; xng IR3 on or near an unknown manifold M, and produces as output a simplicia...
IJWIN
2006
13 years 7 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We describe an empirical study on the feature space of interest points for natural images. Although local features have been widely used in image analysis as building blocks of va...
CGI
2001
IEEE
13 years 11 months ago
2001
IEEE
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...