5316 search results - page 160 / 1064 » Which Search Problems Are Random |
142
Voted
COR
2010
15 years 3 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
130
Voted
FGR
2011
IEEE
14 years 7 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
107
Voted
CP
1997
Springer
15 years 7 months ago
1997
Springer
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
131
Voted
SDM
2009
SIAM
16 years 25 days ago
2009
SIAM
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
142
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...