285 search results - page 48 / 57 » New Ways to Construct Binary Search Trees |
204
click to vote
COCO
2009
Springer
16 years 19 days ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
222
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
151
click to vote
WEBDB
2010
Springer
15 years 11 months ago
2010
Springer
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
176
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
144
click to vote
AIRS
2004
Springer
15 years 9 months ago
2004
Springer
Topic distillation aims at finding key resources which are high-quality pages for certain topics. With analysis in non-content features of key resources, a pre-selection method is ...