Sciweavers

1038 search results - page 1 / 208
» Space-Bounded Query Approximation
Sort
View
ECCC
2010
98views more  ECCC 2010»
13 years 4 months ago
A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
Amit Chakrabarti
SIGMOD
2006
ACM
107views Database» more  SIGMOD 2006»
14 years 4 months ago
Relaxed space bounding for moving objects: a case for the buddy tree
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
Shuqiao Guo, Zhiyong Huang, H. V. Jagadish, Beng C...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 5 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
SPIRE
2010
Springer
13 years 3 months ago
Colored Range Queries and Document Retrieval
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
LATIN
2004
Springer
13 years 10 months ago
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
Graham Cormode, S. Muthukrishnan