Sciweavers

223 search results - page 34 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
ICASSP
2008
IEEE
15 years 6 months ago
Fine: Information embedding for document classification
The problem of document classification considers categorizing or grouping of various document types. Each document can be represented as a bag of words, which has no straightforw...
Kevin M. Carter, Raviv Raich, Alfred O. Hero
PVLDB
2008
116views more  PVLDB 2008»
14 years 11 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ESA
2003
Springer
96views Algorithms» more  ESA 2003»
15 years 5 months ago
Streaming Geometric Optimization Using Graphics Hardware
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
15 years 12 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
MLDM
2008
Springer
14 years 11 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic