5316 search results - page 6 / 1064 » Which Search Problems Are Random |
CPAIOR
2006
Springer
13 years 11 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...
WWW
2006
ACM
14 years 8 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...
CIKM
2008
Springer
13 years 9 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...
HEURISTICS
1998
13 years 7 months 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...
FSTTCS
1991
Springer
13 years 11 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...