Sciweavers

15 search results - page 2 / 3
» Extremal properties of polynomial threshold functions
Sort
View
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
13 years 11 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
STACS
1998
Springer
13 years 9 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John
ICASSP
2011
IEEE
12 years 8 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...
ESA
2007
Springer
113views Algorithms» more  ESA 2007»
13 years 11 months ago
Distance Coloring
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
Alexa Sharp
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
13 years 10 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber