967 search results - page 76 / 194 » On the efficiency of adaptive MCMC algorithms |
215
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
122
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
In this note we describe a general technique for making treestructured dynamic dictionaries adapt to be competitive with the most efficient implementation, by using potential ener...
156
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
170
click to vote
BIBM
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
156
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...