1554 search results - page 98 / 311 » Parameterized Complexity and Approximation Algorithms |
120
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
125
click to vote
NIPS
2008
15 years 5 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
154
click to vote
JMLR
2008
15 years 3 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
116
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
128
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...