Sciweavers

1434 search results - page 74 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ANOR
2004
116views more  ANOR 2004»
13 years 7 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ICIP
2004
IEEE
14 years 9 months ago
Decomposition of range images using markov random fields
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...
Andreas Pichler, Robert B. Fisher, Markus Vincze
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 8 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
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...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICIP
2007
IEEE
14 years 9 months ago
Automatic Parametrisation for an Image Completion Method Based on Markov Random Fields
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...
Huy Tho Ho, Roland Göcke
ICDE
2002
IEEE
116views Database» more  ICDE 2002»
14 years 9 months ago
SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks
Scalable storage architectures allow for the addition of disks to increase storage capacity and/or bandwidth. In its general form, disk scaling also refers to disk removals when e...
Ashish Goel, Cyrus Shahabi, Shu-Yuen Didi Yao, Rog...