3875 search results - page 363 / 775 » Approximation algorithms for the 0-extension problem |
175
click to vote
ICALP
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
214
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Automatic evaluation of visual tracking algorithms in the absence of ground truth is a very challenging and important problem. In the context of online appearance modeling, there ...
197
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
152
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
156
click to vote
ACISICIS
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...