5316 search results - page 6 / 1064 » Which Search Problems Are Random |
129
click to vote
CPAIOR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
117
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
119
click to vote
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
126
click to vote
HEURISTICS
1998
15 years 10 days ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
127
click to vote
FSTTCS
1991
Springer
15 years 4 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...