Sciweavers

327 search results - page 6 / 66
» Some Elimination Problems for Matrices
Sort
View
ICALP
2010
Springer
13 years 11 months ago
Choosing, Agreeing, and Eliminating in Communication Complexity
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
IRI
2008
IEEE
14 years 4 months ago
Eliminating the threat of kernel stack overflows
The Linux kernel stack has a fixed size. There is no mechanism to prevent the kernel from overflowing the stack. Hackers can exploit this bug to put unwanted information in the me...
Yair Wiseman, Joel Isaacson, Eliad Lubovsky
JC
2000
138views more  JC 2000»
13 years 9 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
ECCC
2002
103views more  ECCC 2002»
13 years 9 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
ICASSP
2011
IEEE
13 years 1 months ago
A unified framework for GLRT-based spectrum sensing of signals with covariance matrices with known eigenvalue multiplicities
In this paper, we create a unified framework for spectrum sensing of signals which have covariance matrices with known eigenvalue multiplicities. We derive the generalized likeli...
Erik Axell, Erik G. Larsson