Sciweavers

885 search results - page 112 / 177
» Random Matrices in Data Analysis
Sort
View
INFOCOM
2000
IEEE
14 years 8 days ago
On the Aggregatability of Multicast Forwarding State
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
David Thaler, Mark Handley
SIGCSE
2010
ACM
158views Education» more  SIGCSE 2010»
13 years 8 months ago
The benefits of pairing by ability
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
Grant Braught, John MacCormick, Tim Wahls
ICPP
2009
IEEE
13 years 5 months ago
Mediacoop: Hierarchical Lookup for P2P-VoD Services
The random seeking in P2P-VoD system requires efficient lookup for "good" suppliers. The main challenge is that good suppliers should meet two requirements: "conten...
Tieying Zhang, Jianming Lv, Xueqi Cheng
IGARSS
2009
13 years 5 months ago
Classification Performance of Random-projection-based Dimensionality Reduction of Hyperspectral Imagery
High-dimensional data such as hyperspectral imagery is traditionally acquired in full dimensionality before being reduced in dimension prior to processing. Conventional dimensiona...
James E. Fowler, Qian Du, Wei Zhu, Nicolas H. Youn...
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
12 years 10 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park