3055 search results - page 102 / 611 » Randomized Search Trees |
101
click to vote
SIGMOD
1999
ACM
15 years 5 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
102
click to vote
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
120
Voted
ALGORITHMICA
2010
15 years 27 days ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
92
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Documents in the Web are often organized using category trees by information providers (e.g. CNN, BBC) or search engines (e.g. Google, Yahoo!). Such category trees are commonly kn...
98
Voted
JFP
2006
15 years 22 days ago
2006
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...