Sciweavers

4536 search results - page 303 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 9 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
3DIM
2007
IEEE
16 years 1 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
DCC
2000
IEEE
15 years 11 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 3 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
JIIS
2006
83views more  JIIS 2006»
15 years 6 months ago
Querying a summary of database
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
W. Amenel Voglozin, Guillaume Raschia, Laurent Ugh...