Sciweavers

1458 search results - page 172 / 292
» Monads for incremental computing
Sort
View
129
Voted
ALP
1994
Springer
15 years 7 months ago
Compositional Analysis for Equational Horn Programs
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
María Alpuente, Moreno Falaschi, Germ&aacut...
147
Voted
APSEC
2001
IEEE
15 years 7 months ago
A Framework for Migrating Procedural Code to Object-Oriented Platforms
With the rapid growth of the Internet and pervasive computing activities, the migration of back-end legacy systems to network centric environments has become a focal point for res...
Ying Zou, Kostas Kontogiannis
144
Voted
AAAI
2008
15 years 6 months ago
Loop Calculus for Satisfiability
Loop Calculus, introduced by Chertkov and Chernyak, is a new technique to incrementally improve approximations computed by Loopy Belief Propagation (LBP), with the ability to even...
Lukas Kroc, Michael Chertkov
188
Voted
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
15 years 5 months ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
92
Voted
LREC
2010
131views Education» more  LREC 2010»
15 years 5 months ago
A Database for the Exploration of Spanish Planning
We describe a new task-based corpus in the Spanish language. The corpus consists of videos, transcripts, and annotations of the interaction between a naive speaker and a confedera...
Carlos Gómez Gallo, T. Florian Jaeger, Katr...