369 search results - page 30 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
105
click to vote
IJFCS
2002
14 years 11 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
178
click to vote
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...
SIAMCOMP
2008
14 years 11 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
111
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
107
click to vote
UAI
2001
15 years 1 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...