Sciweavers

2286 search results - page 103 / 458
» Algorithms for Categorical Equivalence
Sort
View
ENTCS
2007
137views more  ENTCS 2007»
14 years 10 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
ISQED
2008
IEEE
117views Hardware» more  ISQED 2008»
15 years 4 months ago
A Basis for Formal Robustness Checking
Correct input/output behavior of circuits in presence of internal malfunctions becomes more and more important. But reliable and efficient methods to measure this robustness are ...
Görschwin Fey, Rolf Drechsler
ICNP
2007
IEEE
15 years 4 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee
NAACL
2003
14 years 11 months ago
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
Bo Pang, Kevin Knight, Daniel Marcu
CORR
2008
Springer
70views Education» more  CORR 2008»
14 years 10 months ago
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
Dominique Bontemps