Sciweavers

407 search results - page 38 / 82
» Malleable Proof Systems and Applications
Sort
View
GC
2004
Springer
14 years 1 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
SIAMCO
2008
130views more  SIAMCO 2008»
13 years 7 months ago
Important Moments in Systems and Control
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
Christopher I. Byrnes, Anders Lindquist
STACS
2001
Springer
14 years 1 days ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
LICS
1994
IEEE
13 years 11 months ago
Logical Bilattices and Inconsistent Data
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....
Ofer Arieli, Arnon Avron
ACL
2006
13 years 9 months ago
Correcting ESL Errors Using Phrasal SMT Techniques
This paper presents a pilot study of the use of phrasal Statistical Machine Translation (SMT) techniques to identify and correct writing errors made by learners of English as a Se...
Chris Brockett, William B. Dolan, Michael Gamon