4485 search results - page 201 / 897 » Equivalences on Observable Processes |
149
click to vote
TLCA
2005
Springer
16 years 1 days ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
211
click to vote
FOSSACS
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
161
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
182
click to vote
PAMI
2007
15 years 6 months ago
2007
—This paper considers the problem of reconstructing visually realistic 3D models of dynamic semitransparent scenes, such as fire, from a very small set of simultaneous views (eve...
143
click to vote
GPCE
2003
Springer
15 years 11 months ago
2003
Springer
Multimedia stream processing is a rapidly evolving domain which requires much software development and expects high performance. Developing a streaming application often involves l...