Sciweavers

1414 search results - page 109 / 283
» Randomness and Universal Machines
Sort
View
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 1 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
CVPR
2009
IEEE
15 years 5 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
CVPR
2009
IEEE
15 years 5 months ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
CP
2007
Springer
14 years 4 months ago
Solution Directed Backjumping for QCSP
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
Fahiem Bacchus, Kostas Stergiou