Sciweavers

973 search results - page 125 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
1998
Springer
105views Education» more  CORR 1998»
15 years 5 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
ICASSP
2011
IEEE
14 years 10 months ago
Error-entropy based channel state estimation of spatially correlated MIMO-OFDM
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen
ICASSP
2011
IEEE
14 years 10 months ago
Improvement to esprit-type frequency estimators via reducing data redundancy
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
Weize Sun, Hing Cheung So
EUROCRYPT
2012
Springer
13 years 8 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 6 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström