Sciweavers

3019 search results - page 522 / 604
» Approximating the Domatic Number
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
16 years 6 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 6 months ago
Tensor-CUR decompositions for tensor-based data
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
Michael W. Mahoney, Mauro Maggioni, Petros Drineas
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 6 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 6 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb