9849 search results - page 307 / 1970 » Algorithms and Experiments for the Webgraph |
211
click to vote
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
200
click to vote
CLEF
2008
Springer
15 years 9 months ago
2008
Springer
This article describes our participation at the Domain-Specific track. We used the Xtrieval framework [2], [3] for the preparation and execution of the experiments. The translatio...
185
click to vote
ICIP
2002
IEEE
16 years 9 months ago
2002
IEEE
Geometric attacks are among the most challenging problems in present day watermarking. Such attacks are very simple to implement yet they can defeat most of the existing watermark...
188
click to vote
CIMCA
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we analyse the properties of the standard circular hidden Markov model (HMM) on 2D shape recognition. We point out the limitations of the circular HMMs and further ...
182
click to vote
CEC
2005
IEEE
16 years 28 days ago
2005
IEEE
Abstract- Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. To demonstrate...