Sciweavers

2834 search results - page 4 / 567
» Representing Trees with Constraints
Sort
View
ICIP
1999
IEEE
14 years 9 months ago
Representing and Retrieving Regions Using Binary Partition Trees
This paper discusses the interest of Binary Partition Trees for image and region representation in the context of indexing and similarity based retrieval. Binary Partition Trees c...
Luis Garrido, Philippe Salembier, Josep R. Casas
CADE
2008
Springer
14 years 8 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
BIOINFORMATICS
2010
109views more  BIOINFORMATICS 2010»
13 years 7 months ago
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters
Phylogenetic trees are widely used to display estimates of how groups of species evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species ...
Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H...
CP
2007
Springer
14 years 1 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
ECML
2007
Springer
14 years 1 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban