3875 search results - page 130 / 775 » Approximation algorithms for the 0-extension problem |
260
click to vote
CVPR
2010
IEEE
14 years 1 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 (...
267
Voted
DAC
2011
ACM
14 years 4 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
166
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
134
Voted
OL
2007
15 years 4 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
128
Voted
FLAIRS
2009
15 years 2 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...