Sciweavers

294 search results - page 53 / 59
» Approximate query processing using wavelets
Sort
View
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
14 years 1 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
CVIU
2011
13 years 2 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi