Sciweavers

3360 search results - page 434 / 672
» Opportunistic Data Structures with Applications
Sort
View
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
GPCE
2007
Springer
15 years 11 months ago
Simple and safe SQL queries with c++ templates
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
Joseph Gil, Keren Lenz
IPMI
2005
Springer
15 years 10 months ago
Fundamental Limits in 3D Landmark Localization
This work analyses the accuracy of estimating the location of 3D landmarks and characteristic image structures. Based on nonlinear estimation theory we study the minimal stochastic...
Karl Rohr