Sciweavers

575 search results - page 3 / 115
» A Spectral Approach to Lower Bounds
Sort
View
ASPDAC
2005
ACM
101views Hardware» more  ASPDAC 2005»
14 years 28 days ago
Lower bounds for dynamic BDD reordering
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
Rüdiger Ebendt, Rolf Drechsler
FOCS
2008
IEEE
14 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CSR
2008
Springer
13 years 9 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
ICASSP
2010
IEEE
13 years 7 months ago
Wideband spectral estimation from compressed measurements exploiting spectral a priori information in Cognitive Radio systems
In Cognitive Radio scenarios channelization information from primary network may be available to the spectral monitor. Under this assumption we propose a spectral estimation algor...
Gonzalo Vazquez-Vilar, Roberto López-Valcar...
TCOM
2010
101views more  TCOM 2010»
13 years 2 months ago
Spectral efficient transmit diversity techniques without cyclic prefix for fading relay channels
Abstract--This paper proposes spectral efficient relayassisted transmit diversity techniques, i.e., space-time and space-frequency block codes (STBC/SFBC), for single carrier frequ...
Ui-Kun Kwon, Dae-Young Seol, Gi-Hong Im