Sciweavers

344 search results - page 1 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
15 years 10 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
CCCG
2009
14 years 10 months ago
Streaming 1-Center with Outliers in High Dimensions
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
Hamid Zarrabi-Zadeh, Asish Mukhopadhyay
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
227
Voted
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 3 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 10 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...