Sciweavers

330 search results - page 25 / 66
» Effective Complexity and its Relation to Logical Depth
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
KI
2007
Springer
14 years 1 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...
TVCG
2011
126views more  TVCG 2011»
13 years 2 months ago
A Comparison of Gradient Estimation Methods for Volume Rendering on Unstructured Meshes
—This paper presents a study of gradient estimation methods for rendering unstructured-mesh volume data. Gradient estimation is necessary for rendering shaded isosurfaces and spe...
Carlos D. Correa, Robert Hero, Kwan-Liu Ma
COMPGEOM
2008
ACM
13 years 9 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
CSCLP
2007
Springer
14 years 1 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth