12519 search results - page 249 / 2504 » Approximation Problems Categories |
178
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
153
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
170
click to vote
JAIR
2000
15 years 6 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
159
click to vote
SIAMCO
2002
15 years 6 months ago
2002
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
167
click to vote
PAMI
2011
15 years 1 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...