Sciweavers

995 search results - page 20 / 199
» complexity 2011
Sort
View
JC
2011
87views more  JC 2011»
14 years 6 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 2 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
ICASSP
2011
IEEE
14 years 3 months ago
Complex random matrices and multiple-antenna spectrum sensing
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
Tharmalingam Ratnarajah, Caijun Zhong, Ayse Kortun...
GPCE
2011
Springer
13 years 11 months ago
Comparing complexity of API designs: an exploratory experiment on DSL-based framework integration
Embedded, textual DSLs are often provided as an API wrapped around object-oriented application frameworks to ease framework integration. While literature presents claims that DSL-...
Stefan Sobernig, Patrick Gaubatz, Mark Strembeck, ...
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 6 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef