Sciweavers

4377 search results - page 74 / 876
» Mass problems and randomness
Sort
View
CP
1998
Springer
15 years 2 months ago
Random Constraint Satisfaction: Theory Meets Practice
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
Ewan MacIntyre, Patrick Prosser, Barbara M. Smith,...
ECCV
2008
Springer
16 years 2 months ago
Generative Image Segmentation Using Random Walks with Restart
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
15 years 10 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
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 2 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
DKE
2002
107views more  DKE 2002»
14 years 9 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias