Sciweavers

19 search results - page 3 / 4
» Approximate Range Searching in External Memory
Sort
View
ATAL
2010
Springer
13 years 5 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ICMCS
2006
IEEE
179views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Scalable Rate-Distortion-Computation Hardware Accelerator for MCTF and ME
Motion-Compensated Temporal Filtering (MCTF) is an innovative prediction scheme for video coding and the core technology of scalable extension of H.264/AVC. The first MCTF and ME...
Yi-Hau Chen, Ching-Yeh Chen, Chih-Chi Cheng, Liang...
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
13 years 1 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
SBBD
2008
256views Database» more  SBBD 2008»
14 years 5 days ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan