288 search results - page 54 / 58 » Compositional Machine Transliteration |
EUROSYS
2010
ACM
14 years 6 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
RTSS
2007
IEEE
14 years 4 months ago
2007
IEEE
The increased complexity of performance-sensitive software systems leads to increased use of automated adaptation policies in lieu of manual performance tuning. Composition of ada...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
XIMEP
2004
ACM
14 years 3 months ago
2004
ACM
Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML doc...