Sciweavers

3341 search results - page 298 / 669
» On Bounded Queries and Approximation
Sort
View
DCC
2007
IEEE
16 years 6 months ago
Nonuniform Compression in Databases with Haar Wavelet
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from ...
S. Chen, A. Nucci
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
16 years 8 months ago
SWAT: Hierarchical Stream Summarization in Large Networks
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Ahmet Bulut, Ambuj K. Singh
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
16 years 6 days ago
T-SIX: An Indexing System for XML Siblings
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
SungRan Cho
IJCV
2006
146views more  IJCV 2006»
15 years 6 months ago
An A Contrario Decision Method for Shape Element Recognition
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
Pablo Musé, Frédéric Sur, Fr&...
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
14 years 2 months ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes