269 search results - page 35 / 54 » A branch and bound method for stochastic global optimization |
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
JSCIC
2010
14 years 4 months ago
2010
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
ALMOB
2006
14 years 9 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
81
Voted
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
— In the field of mobile robotics, trajectory details are seldom taken into account to qualify robot performance. Most metrics rely mainly on global results such as the total ti...
ADC
2003
Springer
15 years 2 months ago
2003
Springer
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...