Sciweavers

732 search results - page 98 / 147
» corr 2011
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 7 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
CORR
2011
Springer
163views Education» more  CORR 2011»
14 years 7 months ago
Suboptimal Solution Path Algorithm for Support Vector Machine
We consider a suboptimal solution path algorithm for the Support Vector Machine. The solution path algorithm is an effective tool for solving a sequence of a parametrized optimiz...
Masayuki Karasuyama, Ichiro Takeuchi
CORR
2011
Springer
209views Education» more  CORR 2011»
14 years 7 months ago
Analysis and Improvement of Low Rank Representation for Subspace segmentation
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
Siming Wei, Zhouchen Lin
CORR
2011
Springer
265views Education» more  CORR 2011»
14 years 7 months ago
Signal Processing in Large Systems: a New Paradigm
—For a long time, signal processing applications, and most particularly detection and parameter estimation methods, have relied on the limiting behaviour of test statistics and e...
Romain Couillet, Mérouane Debbah
126
Voted
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 11 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg