Sciweavers

3889 search results - page 122 / 778
» A Framework for Optimizing Paper Matching
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 4 months ago
Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Peter A. N. Bosman, Han La Poutré
ICPR
2008
IEEE
15 years 11 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 3 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
ICCV
2007
IEEE
14 years 11 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
LATIN
2010
Springer
15 years 4 months ago
Optimal Polygonal Representation of Planar Graphs
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...