6155 search results - page 346 / 1231 » A language for multiple models of computation |
187
click to vote
COLING
1996
15 years 8 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
209
click to vote
CSI
2007
15 years 6 months ago
2007
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
183
click to vote
CRYPTO
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...
195
Voted
MODELS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We present ModHel’X, an approach to multi-formalism modeling which addresses two important issues in this field: (a) providing support for the specification of the se...
221
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...