Sciweavers

1833 search results - page 27 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
CEC
2009
IEEE
14 years 1 months ago
Memetic algorithm with Local search chaining for large scale continuous optimization problems
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
Daniel Molina, Manuel Lozano, Francisco Herrera
BMCV
2000
Springer
14 years 29 days ago
A New Line Segment Grouping Method for Finding Globally Optimal Line Segments
In this paper we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantage...
Jeong-Hun Jang, Ki-Sang Hong
RECOMB
2007
Springer
14 years 9 months ago
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
We describe an algorithm, IsoRank, for global alignment of two protein-protein interaction (PPI) networks. IsoRank aims to maximize the overall match between the two networks; in c...
Rohit Singh, Jinbo Xu, Bonnie Berger
ECCV
2008
Springer
14 years 10 months ago
Hierarchical Support Vector Random Fields: Joint Training to Combine Local and Global Features
Abstract. Recently, impressive results have been reported for the detection of objects in challenging real-world scenes. Interestingly however, the underlying models vary greatly e...
Paul Schnitzspan, Mario Fritz, Bernt Schiele
BMCBI
2010
116views more  BMCBI 2010»
13 years 8 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel