2834 search results - page 105 / 567 » Representing Trees with Constraints |
COMPULOG
1999
Springer
14 years 2 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
ISBI
2006
IEEE
14 years 11 months ago
2006
IEEE
In this paper, we use marked point processes to perform an unsupervised extraction of the coronary tree from 2D X-ray angiography. These processes provide a rigorous framework bas...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
ICIAR
2005
Springer
14 years 3 months ago
2005
Springer
Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven’t been explored further until recently. This paper shows how 2-D s...