Sciweavers

20294 search results - page 3808 / 4059
» Algorithmic Information Theory
Sort
View
FOIKS
2006
Springer
15 years 10 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 10 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
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 10 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
SPATIALCOGNITION
2000
Springer
15 years 10 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
ICCV
1995
IEEE
15 years 10 months ago
Closed-World Tracking
A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the co...
Stephen S. Intille, Aaron F. Bobick
« Prev « First page 3808 / 4059 Last » Next »