12 search results - page 1 / 3 » Where is Randomness Needed to Break the Square-Root Bottlene... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
JCSS
2008
13 years 4 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
CJ
2011
12 years 8 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
BCS
2008
13 years 6 months ago
2008
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
RAID
2009
Springer
13 years 11 months ago
2009
Springer
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs...