10901 search results - page 1842 / 2181 » Approximations in Distributed Optimization |
172
click to vote
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
134
click to vote
SIROCCO
2010
15 years 6 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
163
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
157
click to vote
AAAI
2006
15 years 6 months ago
2006
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
135
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...