322 search results - page 39 / 65 » On the Complexity of Reverse Similarity Search |
120
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
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...
135
click to vote
CPAIOR
2010
Springer
14 years 9 months ago
2010
Springer
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...
JSA
2000
14 years 11 months ago
2000
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...
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
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 ...
102
click to vote
FGR
2006
IEEE
15 years 5 months ago
2006
IEEE
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...