Sciweavers

122 search results - page 21 / 25
» Using Model Counting to Find Optimal Distinguishing Tests
Sort
View
MANSCI
2007
90views more  MANSCI 2007»
14 years 9 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
ICCV
2007
IEEE
15 years 11 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
RECOMB
2005
Springer
15 years 10 months ago
Alignment of Optical Maps
We introduce a new scoring method for calculation of alignments of optical maps. Missing cuts, false cuts, and sizing errors present in optical maps are addressed by our alignment...
Anton Valouev, Lei Li, Yu-Chi Liu, David C. Schwar...
TEC
2008
104views more  TEC 2008»
14 years 9 months ago
Coevolution of Fitness Predictors
Abstract--We present an algorithm that coevolves fitness predictors, optimized for the solution population, which reduce fitness evaluation cost and frequency, while maintaining ev...
Michael D. Schmidt, Hod Lipson
CVPR
2007
IEEE
15 years 11 months ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren