Sciweavers

1396 search results - page 43 / 280
» Succinct Dynamic Data Structures
Sort
View
IPL
2007
101views more  IPL 2007»
15 years 1 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
ISORC
2008
IEEE
15 years 7 months ago
Structural Model of Real-Time Databases: An Illustration
A real-time database is a database in which both the data and the operations upon the data may have timing constraints. The design of this kind of database requires the introducti...
Nizar Idoudi, Claude Duvallet, Bruno Sadeg, Rafik ...
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
16 years 1 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 10 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 12 months ago
Dynamic Range Reporting in External Memory
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Yakov Nekrich