13 search results - page 1 / 3 » The complexity of choosing an H-colouring (nearly) uniformly... |
STOC
2002
ACM
15 years 10 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...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
175
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...