Sciweavers

2889 search results - page 339 / 578
» Querying Structured Hyperdocuments
Sort
View
144
Voted
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
DCC
2008
IEEE
16 years 6 months ago
On Self-Indexing Images - Image Compression with Added Value
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
Veli Mäkinen, Gonzalo Navarro
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
16 years 1 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
ICASSP
2008
IEEE
16 years 1 months ago
An iterative unsupervised learning method for information distillation
Information distillation techniques are used to analyze and interpret large volumes of speech and text archives in multiple languages and produce structured information of interes...
Kamand Kamangar, Dilek Hakkani-Tür, Gökh...
ATAL
2007
Springer
16 years 25 days ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros