Sciweavers

2863 search results - page 144 / 573
» Computer modelling and natural phenomena
Sort
View
COLING
1996
15 years 7 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
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...
Khalil Sima'an
CSI
2007
89views more  CSI 2007»
15 years 6 months ago
Writing and executing ODP computational viewpoint specifications using Maude
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 ...
José Raúl Romero, Antonio Vallecillo...
DC
2008
15 years 6 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
CICLING
2004
Springer
15 years 11 months ago
Towards Programming in Everyday Language: A Case for Email Management
Abstract. In order to extend the application domain of natural language interfaces to more realistic tasks without the decrease of user’s performance, it is desirable for users t...
Toru Sugimoto, Noriko Ito, Shino Iwashita, Michio ...
FOCS
2007
IEEE
16 years 23 days ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat