Sciweavers

391 search results - page 10 / 79
» Structural and algorithmic issues of dynamic protocol update
Sort
View
ICALP
2001
Springer
13 years 12 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, ...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
13 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
TSD
2007
Springer
14 years 1 months ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
ICDE
1999
IEEE
118views Database» more  ICDE 1999»
14 years 8 months ago
Maintaining Data Cubes under Dimension Updates
OLAP systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application-related dimensions", or...
Carlos A. Hurtado, Alberto O. Mendelzon, Alejandro...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld