Sciweavers

322 search results - page 39 / 65
» On the Complexity of Reverse Similarity Search
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Efficient Sampling of Disparity Space for Fast And Accurate Matching
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
Jan Cech, Radim Sára
CPAIOR
2010
Springer
13 years 6 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
JSA
2000
115views more  JSA 2000»
13 years 8 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
KBSE
2009
IEEE
14 years 3 months ago
Let the Ants Deploy Your Software - An ACO Based Deployment Optimisation Strategy
Abstract—Decisions regarding the mapping of software components to hardware nodes affect the quality of the resulting system. Making these decisions is hard when considering the ...
Aldeida Aleti, Lars Grunske, Indika Meedeniya, Ire...
FGR
2006
IEEE
173views Biometrics» more  FGR 2006»
14 years 2 months ago
Facial Feature Detection and Tracking with Automatic Template Selection
We describe an accurate and robust method of locating facial features. The method utilises a set of feature templates in conjunction with a shape constrained search technique. The...
David Cristinacce, Timothy F. Cootes