6251 search results - page 441 / 1251 » Randomness, Computability, and Density |
213
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
181
click to vote
ICALP
2004
Springer
16 years 7 days ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
162
click to vote
CRYPTO
2005
Springer
16 years 12 days ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
178
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We address in this paper the problem of segmenting complex handritten pages such as novelist drafts or authorial manuscripts. We propose to use stochastic and contextual models in...
171
Voted
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
In this paper we address the problem of simultaneous estimation of structure and restoration of images from blurred photometric measurements. Given the blurred observations of a s...