Sciweavers

4886 search results - page 57 / 978
» Approximate Data Exchange
Sort
View
EMNLP
2011
14 years 4 months ago
Approximate Scalable Bounded Space Sketch for Large Data NLP
We exploit sketch techniques, especially the Count-Min sketch, a memory, and time efficient framework which approximates the frequency of a word pair in the corpus without explic...
Amit Goyal, Hal Daumé III
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 10 months ago
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
Qi Zhang, Wei Wang 0010
SEBD
2003
144views Database» more  SEBD 2003»
15 years 5 months ago
Approximate Query Answering on Sensor Network Data Streams
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari,...
DAWAK
2006
Springer
15 years 8 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
CVPR
2010
IEEE
15 years 2 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel