3875 search results - page 651 / 775 » Approximation algorithms for the 0-extension problem |
145
click to vote
ICCV
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
134
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
171
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
135
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
123
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...