Sciweavers

11211 search results - page 198 / 2243
» Data Structures
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 11 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ICALP
2001
Springer
15 years 11 months ago
A Framework for Index Bulk Loading and Dynamization
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, ...
ICSE
1999
IEEE-ACM
15 years 10 months ago
Identifying Objects Using Cluster and Concept Analysis
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
Arie van Deursen, Tobias Kuipers
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
BMCBI
2008
117views more  BMCBI 2008»
15 years 6 months ago
RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure
Background: With the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is neede...
Qi Liu, Yu Yang, Chun Chen, Jiajun Bu, Yin Zhang, ...