Sciweavers

1132 search results - page 194 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 8 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 8 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
GLOBECOM
2008
IEEE
15 years 8 months ago
Non-Coherent Amplify-and-Forward Generalized Likelihood Ratio Test Receiver
Abstract—This paper proposes a simple non-coherent amplifyand-forward receiver for the relay channel and evaluates its diversity performance for Rayleigh fading channels. We use ...
Michael R. Souryal
GLOBECOM
2008
IEEE
15 years 8 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh
ICASSP
2008
IEEE
15 years 8 months ago
Link throughput of multi-channel opportunistic access with limited sensing
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
Keqin Liu, Qing Zhao