Sciweavers

103 search results - page 5 / 21
» Online Maintenance of Very Large Random Samples
Sort
View
111
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
73
Voted
ICML
2005
IEEE
16 years 14 days ago
Intrinsic dimensionality estimation of submanifolds in Rd
We present a new method to estimate the intrinsic dimensionality of a submanifold M in Rd from random samples. The method is based on the convergence rates of a certain U-statisti...
Matthias Hein, Jean-Yves Audibert
ICML
2009
IEEE
16 years 14 days ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
113
Voted
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 3 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICIP
2010
IEEE
14 years 9 months ago
Compressed sensing for aperture synthesis imaging
The theory of compressed sensing has a natural application in interferometric aperture synthesis. As in many real-world applications, however, the assumption of random sampling, w...
Stephan Wenger, Soheil Darabi, Pradeep Sen, Karl-H...