Sciweavers

130 search results - page 9 / 26
» Algorithms for Finding a Most Similar Subforest
Sort
View
144
Voted
CLEF
2010
Springer
15 years 4 months ago
Visual Localization Using Global Visual Features and Vanishing Points
Abstract. This paper describes a visual localization approach for mobile robots. Robot localization is performed as location recognition. The approach uses global visual features (...
Olivier Saurer, Friedrich Fraundorfer, Marc Pollef...
265
Voted
CEC
2003
IEEE
13 years 9 months ago
Self Adaptive Island GA
Exploration efficiency of GAs largely depends on parameter values. But, it is hard to manually adjust these values. To cope with this problem, several adaptive GAs which automatica...
Takashima, E.,Murata, Y., Shibata, N., Ito, M.
142
Voted
BMCBI
2005
152views more  BMCBI 2005»
15 years 3 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer
GBRPR
2007
Springer
15 years 9 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
155
Voted
JSAT
2010
132views more  JSAT 2010»
14 years 10 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres