Sciweavers

1054 search results - page 12 / 211
» Fast Approximated SIFT
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
RANDOM
1999
Springer
15 years 3 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
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...
Tugkan Batu, Ronitt Rubinfeld, Patrick White
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
15 years 11 months ago
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis...
NA
2006
59views more  NA 2006»
14 years 11 months ago
On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
When constructing multivariate Pad
Stefan Becuwe, Annie A. M. Cuyt