Sciweavers

1332 search results - page 217 / 267
» Combinatorial Algorithms
Sort
View
ECCC
2006
116views more  ECCC 2006»
13 years 7 months ago
Uniform Hardness Amplification in NP via Monotone Codes
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul...
FOCS
2006
IEEE
14 years 1 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
QEST
2006
IEEE
14 years 1 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
CVPR
2007
IEEE
14 years 9 months ago
Linear and Quadratic Subsets for Template-Based Tracking
We propose a method that dramatically improves the performance of template-based matching in terms of size of convergence region and computation time. This is done by selecting a ...
Selim Benhimane, Alexander Ladikos, Vincent Lepeti...
CVPR
2008
IEEE
14 years 9 months ago
Optical flow estimation with uncertainties through dynamic MRFs
In this paper, we propose a novel dynamic discrete framework to address image morphing with application to optical flow estimation. We reformulate the problem using a number of di...
Ben Glocker, Nikos Paragios, Nikos Komodakis, Geor...