Sciweavers

4850 search results - page 36 / 970
» Approximate Data Structures with Applications
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 4 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
14 years 3 months ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 11 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 10 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
FECS
2009
172views Education» more  FECS 2009»
13 years 7 months ago
Using Interface Inheritance to Structure the Data Structures Course
Traditional instruction in the first data structures course treats object-oriented inheritance and polymorphism as isolated topics if at all. Course organization is an exploration...
Dale Parson, Daniel Spiegel