1399 search results - page 140 / 280 » Multi-party Finite Computations |
150
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
123
Voted
CCCG
2006
15 years 5 months ago
2006
In this paper we study various predicates concerning line transversals to lines and segments in 3D. We compute the degrees of standard methods of evaluating these predicates. The ...
117
Voted
INTERSPEECH
2010
14 years 11 months ago
2010
The emergence of highly parallel computing platforms is enabling new trade-offs in algorithm design for automatic speech recognition. It naturally motivates the following investig...
137
Voted
TCS
2008
15 years 4 months ago
2008
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
139
click to vote
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...