465 search results - page 38 / 93 » On the Hardness of Range Assignment Problems |
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We present an approach to the problem of 3D map building in urban settings for service robots, using threedimensional laser range scans as the main data input. Our system is ba...
TSP
2010
14 years 6 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
DAC
2005
ACM
16 years 25 days ago
2005
ACM
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
NIPS
2007
15 years 1 months ago
2007
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...