681 search results - page 24 / 137 » Searching with expectations |
118
click to vote
ALGORITHMICA
2000
14 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
134
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
111
click to vote
IPL
2002
14 years 11 months ago
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
TREC
2004
15 years 1 months ago
2004
This is the first year that the Dalhousie University participated in TREC. We submitted three runs for the QA track. Our evaluation results are generally below the median (with on...