Sciweavers

4850 search results - page 722 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
16 years 5 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
SI3D
1992
ACM
15 years 9 months ago
Volume Seedlings
Recent advances in software and hardware technology have made direct ray-traced volume rendering of 3-d scalar data a feasible and effective method for imaging of the data's ...
Michael F. Cohen, James S. Painter, Mihir Mehta, K...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 7 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
SBBD
2004
119views Database» more  SBBD 2004»
15 years 6 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 7 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi