11394 search results - page 323 / 2279 » Error-Correcting Data Structures |
122
click to vote
JCDCG
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
136
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
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...
128
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
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...
127
click to vote
ICSE
1999
IEEE-ACM
15 years 8 months ago
1999
IEEE-ACM
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 ...
161
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...