Sciweavers

123 search results - page 22 / 25
» Algorithms for computing variants of the longest common subs...
Sort
View
ECAL
1995
Springer
13 years 11 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph
CVPR
2006
IEEE
14 years 9 months ago
An Intensity-augmented Ordinal Measure for Visual Correspondence
Determining the correspondence of image patches is one of the most important problems in Computer Vision. When the intensity space is variant due to several factors such as the ca...
Anurag Mittal, Visvanathan Ramesh
BMCBI
2010
134views more  BMCBI 2010»
13 years 7 months ago
BayesMotif: de novo protein sorting motif discovery from impure datasets
Background: Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regul...
Jianjun Hu, Fan Zhang
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
ML
2008
ACM
13 years 7 months ago
Margin-based first-order rule learning
Abstract We present a new margin-based approach to first-order rule learning. The approach addresses many of the prominent challenges in first-order rule learning, such as the comp...
Ulrich Rückert, Stefan Kramer