Sciweavers

363 search results - page 21 / 73
» Partial Multicuts in Trees
Sort
View
CIKM
2006
Springer
14 years 1 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
AUSAI
2007
Springer
14 years 1 months ago
Building Classification Models from Microarray Data with Tree-Based Classification Algorithms
Building classification models plays an important role in DNA mircroarray data analyses. An essential feature of DNA microarray data sets is that the number of input variables (gen...
Peter J. Tan, David L. Dowe, Trevor I. Dix
DAM
2010
132views more  DAM 2010»
13 years 10 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...
CP
2007
Springer
14 years 4 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ENTCS
2006
134views more  ENTCS 2006»
13 years 9 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...