Sciweavers

300 search results - page 42 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
AIML
2008
13 years 9 months ago
Undecidability for arbitrary public announcement logic
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Tim French, Hans P. van Ditmarsch
DAGSTUHL
2006
13 years 9 months ago
A note on the size of Craig Interpolants
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
Uwe Schöning, Jacobo Torán
LWA
2004
13 years 9 months ago
Learning Prototype Ontologies by Hierachical Latent Semantic Analysis
An ontology is a speci...cation of a conceptualization, a shared understanding of some domain of interest. The paper develops an algorithm that hierarchically groups words together...
Gerhard Paaß, Jörg Kindermann, Edda Leo...
WSCG
2001
118views more  WSCG 2001»
13 years 9 months ago
Image Based Rendering and General Relativity
Imaged-based rendering is a well-known method in computer graphics to achieve photo-realistic images. In this paper we show how conventional image-based rendering algorithms can b...
Daniel Kobras, Daniel Weiskopf, Hanns Ruder
PDPTA
2000
13 years 9 months ago
Dependable High Performance Computing on a Parallel Sysplex Cluster
In this paper we address the issue of dependable distributed high performance computing in the field of Symbolic Computation. We describe the extension of a middleware infrastructu...
Wolfgang Blochinger, Reinhard Bündgen, Andrea...