Sciweavers

2432 search results - page 311 / 487
» Degrees and choice numbers
Sort
View
SIAMCOMP
2011
15 years 1 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
SIAMDM
2010
194views more  SIAMDM 2010»
15 years 1 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
IMC
2004
ACM
15 years 12 months ago
Availability, usage, and deployment characteristics of the domain name system
The Domain Name System (DNS) is a critical part of the Internet’s infrastructure, and is one of the few examples of a robust, highlyscalable, and operational distributed system....
Jeffrey Pang, James Hendricks, Aditya Akella, Robe...
ICALP
2010
Springer
15 years 11 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
ICALP
2001
Springer
15 years 11 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan