1163 search results - page 94 / 233 » Concurrent Subspaces Analysis |
122
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
128
click to vote
TSP
2008
15 years 3 months ago
2008
We propose a two stage detector consisting of a Subspace Detector (SD) followed by the Whitened Adaptive Beamformer Orthogonal Rejection Test (W-ABORT). The performance analysis sh...
123
Voted
AAAI
2012
13 years 6 months ago
2012
In this paper, a new convex matching pursuit scheme is proposed for tackling large-scale sparse coding and subset selection problems. In contrast with current matching pursuit alg...
111
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
137
Voted
CONCURRENCY
2000
15 years 3 months ago
2000
The Java .class file is a compact encoding of programs for a stack-based virtual machine. It is intended for use in a networked environment, which requires machine independence an...