Sciweavers

210 search results - page 14 / 42
» Classical descriptive set theory as a refinement of effectiv...
Sort
View
EON
2008
13 years 9 months ago
Debugging OWL Ontologies - A Reality Check
One of the arguments for choosing description logics as the basis for the Web Ontology Language is the ability to support the development of complex ontologies through logical reas...
Heiner Stuckenschmidt
FOSSACS
2001
Springer
14 years 4 days ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 7 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Nonideal Sampling and Regularization Theory
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant" space, wh...
Sathish Ramani, Dimitri Van De Ville, Thierry Blu,...
STTT
2010
113views more  STTT 2010»
13 years 2 months ago
Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm