2828 search results - page 36 / 566 » Custom Local Search |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
JSAT
2008
13 years 8 months ago
2008
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
JAIR
2000
13 years 8 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
EVOW
2010
Springer
14 years 3 months ago
2010
Springer
Discriminating between secreted and membrane proteins is a challenging task. This is particularly true for discriminating between transmembrane segments and signal peptides because...
TAINN
2005
Springer
14 years 2 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...