4485 search results - page 201 / 897 » Equivalences on Observable Processes |
107
click to vote
TLCA
2005
Springer
15 years 9 months 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...
157
Voted
FOSSACS
1999
Springer
15 years 7 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 ...
124
Voted
COLT
1995
Springer
15 years 7 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...
133
Voted
PAMI
2007
15 years 3 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...
117
Voted
GPCE
2003
Springer
15 years 8 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...