4850 search results - page 42 / 970 » Approximate Data Structures with Applications |
211
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
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 ...
166
click to vote
JANCL
2006
15 years 6 months ago
2006
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
173
click to vote
COMPGEOM
2009
ACM
16 years 26 days ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
172
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
192
Voted
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
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 ...