154 search results - page 12 / 31 » Algorithms for Implicit Hitting Set Problems |
BMCBI
2007
14 years 9 months ago
2007
Background: High-throughput molecular biology provides new data at an incredible rate, so that the increase in the size of biological databanks is enormous and very rapid. This sc...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a cooperative strategy between volumetric registration and segmentation. The segmentation method is based on the level set formalism. Starting from an initial ...
ISMIS
2000
Springer
15 years 1 months ago
2000
Springer
This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
144
click to vote
ICCV
2011
IEEE
13 years 8 months ago
2011
IEEE
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...