Sciweavers

11212 search results - page 566 / 2243
» Semi-persistent Data Structures
Sort
View
ICMCS
2000
IEEE
103views Multimedia» more  ICMCS 2000»
15 years 11 months ago
Activity-Adaptive Modeling of Dynamic Multimedia Traffic
Most of the existing work on modeling variable bit rate (VBR) video sources does not either explicitly take into account groupof-pictures (GOP) or assumes a fixed GOP structure. R...
Deepak S. Turaga, Tsuhan Chen
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
16 years 1 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
162
Voted
JCDCG
2004
Springer
16 years 12 days ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
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...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 12 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, ...