Sciweavers

1163 search results - page 94 / 233
» Concurrent Subspaces Analysis
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Tighter bounds for random projections of manifolds
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...
Kenneth L. Clarkson
TSP
2008
96views more  TSP 2008»
15 years 6 months ago
An Improved Adaptive Sidelobe Blanker
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...
Francesco Bandiera, Olivier Besson, Danilo Orlando...
AAAI
2012
13 years 8 months ago
Convex Matching Pursuit for Large-Scale Sparse Coding and Subset Selection
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...
Mingkui Tan, Ivor W. Tsang, Li Wang, Xinming Zhang
IPPS
1997
IEEE
15 years 10 months ago
Time-Stamping Algorithms for Parallelization of Loops at Run-Time
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...
Cheng-Zhong Xu, Vipin Chaudhary
CONCURRENCY
2000
155views more  CONCURRENCY 2000»
15 years 6 months ago
Annotating Java class files with virtual registers for performance
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...
Joel Jones, Samuel N. Kamin