Sciweavers

68 search results - page 4 / 14
» Extension of First-Order Theories into Trees
Sort
View
AML
2008
53views more  AML 2008»
13 years 7 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ICIP
2007
IEEE
14 years 1 months ago
Using Dempster-Shafer Theory to Fuse Multiple Information Sources in Region-Based Segmentation
This paper presents a new method for segmentation of images into large regions that reflect the real world objects present in a scene. It explores the feasibility of utilizing sp...
Tomasz Adamek, Noel E. O'Connor
LATA
2009
Springer
14 years 2 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
RECOMB
2004
Springer
14 years 7 months ago
Reconstructing reticulate evolution in species: theory and practice
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...
Luay Nakhleh, Tandy Warnow, C. Randal Linder