Sciweavers

903 search results - page 110 / 181
» Non-well-founded trees in categories
Sort
View
KCAP
2003
ACM
15 years 11 months ago
Modularisation of domain ontologies implemented in description logics and related formalisms including OWL
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
Alan L. Rector
FOCS
1998
IEEE
15 years 10 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
SIGGRAPH
1996
ACM
15 years 10 months ago
Technologies for Augmented Reality Systems: Realizing Ultrasound-Guided Needle Biopsies
We present a real-time stereoscopic video-see-through augmented reality (AR) system applied to the medical procedure known as ultrasound-guided needle biopsy of the breast. The AR...
Andrei State, Mark A. Livingston, William F. Garre...
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
AFRIGRAPH
2009
ACM
15 years 10 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage