Sciweavers

1284 search results - page 139 / 257
» Data Structures for Mergeable Trees
Sort
View
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
15 years 3 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 3 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
124
Voted
WWW
2011
ACM
14 years 9 months ago
Growing parallel paths for entity-page discovery
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
128
Voted
RECOMB
2009
Springer
16 years 3 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...
164
Voted
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 7 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...