42 search results - page 3 / 9 » Simple Effective Decipherment via Combinatorial Optimization |
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper presents preliminary efforts to develop compilation and execution environments that achieve performance portability of multilevel parallelization on hierarchical archit...
CP
2004
Springer
13 years 9 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
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...
PAMI
2007
13 years 5 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
JCNS
2010
13 years 13 days ago
2010
The early processing of sensory information by neuronal circuits often includes a reshaping of activity patterns that may facilitate the further processing of stimulus representat...