Sciweavers

164 search results - page 1 / 33
» A Smallest Generalization Step Strategy
Sort
View
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
13 years 11 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
13 years 9 months ago
Improved step size adaptation for the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is an evolutionary algorithm for continuous vector-valued optimization. It combines indicator-based...
Thomas Voß, Nikolaus Hansen, Christian Igel
ICDAR
2009
IEEE
13 years 2 months ago
A Distance-Based Technique for Non-Manhattan Layout Analysis
Layout analysis is a fundamental step in automatic document processing. Many different techniques have been proposed in literature to perform this task. These are broadly divided ...
Stefano Ferilli, Marenglen Biba, Floriana Esposito...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
13 years 10 months ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng