5316 search results - page 120 / 1064 » Which Search Problems Are Random |
131
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
120
click to vote
ICSM
2006
IEEE
15 years 9 months ago
2006
IEEE
One approach to supporting program comprehension involves binding concepts to source code. Previously proposed approaches to concept binding have enforced nonoverlapping boundarie...
130
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
113
Voted
SOFSEM
2004
Springer
15 years 8 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
154
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...