Sciweavers

140 search results - page 21 / 28
» Clustering via Matrix Powering
Sort
View
IMC
2007
ACM
14 years 10 days ago
A data streaming algorithm for estimating entropies of od flows
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
Haiquan (Chuck) Zhao, Ashwin Lall, Mitsunori Ogiha...
CVPR
2012
IEEE
12 years 1 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
CPHYSICS
2007
222views more  CPHYSICS 2007»
13 years 10 months ago
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A new software code for computing selected eigenvalues and associated eigenvectors of a real symmetric matrix is described. The eigenvalues are either the smallest or those closes...
Matthias Bollhöfer, Yvan Notay
NIPS
2004
14 years 5 days ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
CLUSTER
2007
IEEE
14 years 2 months ago
Identifying energy-efficient concurrency levels using machine learning
Abstract-- Multicore microprocessors have been largely motivated by the diminishing returns in performance and the increased power consumption of single-threaded ILP microprocessor...
Matthew Curtis-Maury, Karan Singh, Sally A. McKee,...