33 search results - page 4 / 7 » On the Scalability of Hypergraph Models for Sparse Matrix Pa... |
145
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
107
click to vote
NIPS
2007
15 years 4 months ago
2007
It is becoming increasingly important to learn from a partially-observed random matrix and predict its missing elements. We assume that the entire matrix is a single sample drawn ...
135
click to vote
WCE
2007
15 years 4 months ago
2007
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...
120
click to vote
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
119
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...