Sciweavers

4057 search results - page 453 / 812
» Linear combination of transformations
Sort
View
TSP
2008
98views more  TSP 2008»
15 years 6 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
TWC
2008
101views more  TWC 2008»
15 years 6 months ago
Simplified receiver design for STBC binary continuous phase modulation
Abstract-- Existing space-time codes have focused on multipleantenna systems with linear modulation schemes such as phaseshift keying and quadrature amplitude modulation. Continuou...
L. Xian, R. Punnoose, H. Liu
ANOR
2004
116views more  ANOR 2004»
15 years 6 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
EOR
2002
165views more  EOR 2002»
15 years 6 months ago
Review of ranking methods in the data envelopment analysis context
Within data envelopment analysis (DEA) is a sub-group of papers in which many researchers have sought to improve the differential capabilities of DEA and to fully rank both effici...
Nicole Adler, Lea Friedman, Zilla Sinuany-Stern
JCSS
2000
116views more  JCSS 2000»
15 years 6 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow