3055 search results - page 369 / 611 » Randomized Search Trees |
118
click to vote
EMNLP
2007
15 years 5 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
118
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
116
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
135
Voted
NAR
2007
15 years 3 months ago
2007
Gene duplication is an important process in evolution. The availability of genome sequences of a number of organisms has made it possible to conduct comprehensive searches for dup...
IPL
2010
15 years 2 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...