Sciweavers

848 search results - page 19 / 170
» Randomness and the linear degrees of computability
Sort
View
SIAMJO
2008
100views more  SIAMJO 2008»
14 years 11 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 10 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
ICASSP
2011
IEEE
14 years 3 months ago
Parallel computation of adaptive lattice filters
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
Dong-hwan Lee, Wonyong Sung
TIT
2010
110views Education» more  TIT 2010»
14 years 6 months ago
Secure communications with insecure feedback: breaking the high-SNR ceiling
A multiple-antenna Gaussian wiretap channel in which the number of antennas at the source is not greater than that at the eavesdropper is considered. Without feedback, the secrecy...
Tùng T. Kim, H. Vincent Poor
STACS
2004
Springer
15 years 5 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...