611 search results - page 39 / 123 » Index Sets of Computable Structures with Decidable Theories |
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from ex...
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
PODC
2010
ACM
13 years 12 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...