Sciweavers

1806 search results - page 76 / 362
» Randomness and halting probabilities
Sort
View
RSA
2008
125views more  RSA 2008»
13 years 8 months ago
The game chromatic number of random graphs
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Tom Bohman, Alan M. Frieze, Benny Sudakov
SIAMSC
2010
130views more  SIAMSC 2010»
13 years 3 months ago
Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations
Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been inves...
Junichi Imai, Reiichiro Kawai
KES
2007
Springer
14 years 3 months ago
Random Germs and Stochastic Watershed for Unsupervised Multispectral Image Segmentation
This paper extends the use of stochastic watershed, recently introduced by Angulo and Jeulin [1], to unsupervised segmentation of multispectral images. Several probability density ...
Guillaume Noyel, Jesús Angulo, Dominique Je...
ICPR
2006
IEEE
14 years 2 months ago
A Conditional Random Field Model for Video Super-resolution
In this paper, we propose a learning-based method for video super-resolution. There are two main contributions of the proposed method. First, information from cameras with differe...
Dan Kong, Mei Han, Wei Xu, Hai Tao, Yihong Gong
SAT
2004
Springer
117views Hardware» more  SAT 2004»
14 years 2 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher