Sciweavers

3007 search results - page 186 / 602
» Linear Functional Fixed-points
Sort
View
CORR
2006
Springer
71views Education» more  CORR 2006»
15 years 3 months ago
Wreath Products in Stream Cipher Design
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
Vladimir Anashin
152
Voted
DAM
2008
102views more  DAM 2008»
15 years 2 months ago
Formulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
Guoli Ding, Robert F. Lax, Jianhua Chen, Peter P. ...
ICASSP
2010
IEEE
15 years 3 months ago
Concave resource allocation problems for interference coupled wireless systems
The paper characterizes the class of all concave resource allocation problems in interference coupled wireless systems. An axiomatic framework for interference functions proposed ...
Holger Boche, Siddharth Naik, Tansu Alpcan
122
Voted
SIAMJO
2010
108views more  SIAMJO 2010»
15 years 1 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer
129
Voted
TIT
2011
131views more  TIT 2011»
14 years 10 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson