15 search results - page 2 / 3 » Boltzmann Samplers for the Random Generation of Combinatoria... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
TCS
2010
13 years 3 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
APSEC
2006
IEEE
13 years 11 months ago
2006
IEEE
Model-based software development is gaining interest in domains such as avionics, space, and automotives. The model serves as the central artifact for the development efforts (suc...
TAINN
2005
Springer
13 years 10 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
SCALESPACE
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...