Sciweavers

793 search results - page 144 / 159
» Protocol Modeling with Model Program Composition
Sort
View
TCS
2008
13 years 7 months ago
Cryptographically-masked flows
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...
Aslan Askarov, Daniel Hedin, Andrei Sabelfeld
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
BMCBI
2010
137views more  BMCBI 2010»
13 years 7 months ago
Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
MSWIM
2005
ACM
14 years 1 months ago
Getting urban pedestrian flow from simple observation: realistic mobility generation in wireless network simulation
In order for precise evaluation of MANET applications, more realistic mobility models are needed in wireless network simulations. In this paper, we focus on the behavior of pedest...
Kumiko Maeda, Kazuki Sato, Kazuki Konishi, Akiko Y...
POPL
2004
ACM
14 years 8 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford