Sciweavers

9849 search results - page 330 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 1 months ago
Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
Zhilin Zhang, Bhaskar D. Rao
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 11 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
INFOCOM
2011
IEEE
14 years 11 months ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
ICASSP
2011
IEEE
14 years 11 months ago
Clustering of bootstrapped acoustic model with full covariance
HMM-based acoustic models built from bootstrap are generally very large, especially when full covariance matrices are used for Gaussians. Therefore, clustering is needed to compac...
Xin Chen, Xiaodong Cui, Jian Xue, Peder Olsen, Joh...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 10 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon