108 search results - page 9 / 22 » Adaptive Sampling for Geometric Problems over Data Streams |
VLDB
2004
ACM
14 years 27 days ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We consider the problem of estimating the relative orientation of a number of individual photocells -or pixels- that hold fixed relative positions. The photocells measure the inte...
ISVC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. When using visualization techniques to explore data streams, an important task is to convey pattern changes. Challenges include: (1) Most data analysis tasks require user...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...