Sciweavers

2661 search results - page 482 / 533
» Quantum Complexity Classes
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 1 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
123
Voted
MOBISYS
2009
ACM
16 years 1 months ago
Longitudinal study of a building-scale RFID ecosystem
Radio Frequency IDentification (RFID) deployments are becoming increasingly popular in both industrial and consumer-oriented settings. To effectively exploit and operate such depl...
Evan Welbourne, Karl Koscher, Emad Soroush, Magdal...
79
Voted
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 1 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
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 1 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 1 months ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler