Sciweavers

1313 search results - page 89 / 263
» The Inference Based on Molecular Computing
Sort
View
AIML
1998
13 years 11 months ago
A Resolution-Based Decision Procedure for Extensions of K4
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
Harald Ganzinger, Ullrich Hustadt, Christoph Meyer...
ICCV
2001
IEEE
14 years 12 months ago
Continuous Global Evidence-Based Bayesian Modality Fusion for Simultaneous Tracking of Multiple Objects
Robust, real-time tracking of objects from visual data requires probabilistic fusion of multiple visual cues. Previous approaches have either been ad hoc or relied on a Bayesian n...
Jamie Sherrah, Shaogang Gong
DLOG
2004
13 years 11 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
JFP
2000
163views more  JFP 2000»
13 years 9 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
14 years 1 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant