Sciweavers

17760 search results - page 272 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 4 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
COLING
2010
15 years 1 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
CVPR
2006
IEEE
16 years 8 months ago
Quantitative Evaluation of Near Regular Texture Synthesis Algorithms
Near regular textures are pervasive in man-made and natural world. Their global regularity and local randomness pose new difficulties to the state of the art texture analysis and ...
Wen-Chieh Lin, James Hays, Chenyu Wu, Yanxi Liu, V...
ICIP
2003
IEEE
16 years 8 months ago
Performance evaluation of Euclidean/correlation-based relevance feedback algorithms in content-based image retrieval systems
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
Anastasios D. Doulamis, Nikolaos D. Doulamis
DAC
2006
ACM
16 years 7 months ago
An efficient retiming algorithm under setup and hold constraints
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...
Chuan Lin, Hai Zhou