67 search results - page 13 / 14 » A polynomial-time approximation algorithm for the number of ... |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...