3341 search results - page 155 / 669 » On Bounded Queries and Approximation |
150
click to vote
PAMI
2007
15 years 4 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
133
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
181
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
150
click to vote
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
153
click to vote
IDA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...