1261 search results - page 46 / 253 » Approximation algorithms for aligning points |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
92
Voted
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
SECON
2007
IEEE
15 years 4 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
78
Voted
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...