Sciweavers

4541 search results - page 288 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
CIKM
2011
Springer
14 years 3 months ago
SIMD-based decoding of posting lists
Powerful SIMD instructions in modern processors offer an opportunity for greater search performance. In this paper, we apply these instructions to decoding search engine posting ...
Alexander A. Stepanov, Anil R. Gangolli, Daniel E....
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 6 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
161
Voted
3DIM
2007
IEEE
15 years 10 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...
DMIN
2010
262views Data Mining» more  DMIN 2010»
15 years 1 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
146
Voted
DCC
2000
IEEE
15 years 8 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