1060 search results - page 198 / 212 » Notes on Coding Theory |
185
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
92
Voted
STOC
2005
ACM
15 years 10 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
177
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...
80
Voted
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...