Sciweavers

216 search results - page 17 / 44
» On the number of minima of a random polynomial
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 9 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
ICASSP
2011
IEEE
12 years 11 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...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
Ueli M. Maurer, Stefano Tessaro
CP
2001
Springer
14 years 4 days ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
JC
2011
87views more  JC 2011»
13 years 2 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration deļ¬ned over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski