Sciweavers

15 search results - page 3 / 3
» Pattern-Matching for Strings with Short Descriptions
Sort
View
SIGCOMM
2006
ACM
15 years 3 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
CSR
2009
Springer
15 years 4 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
CMC
1998
Springer
15 years 1 months ago
Generating Textual Diagrams and Diagrammatic Texts
There are obvious ways in which text and diagrams within a document should be coordinated: for instance, the placement of a diagram might influence the wording of the text. However...
Donia Scott, Richard Power
BMCBI
2010
86views more  BMCBI 2010»
14 years 9 months ago
Mining protein loops using a structural alphabet and statistical exceptionality
Background: Protein loops encompass 50% of protein residues in available three-dimensional structures. These regions are often involved in protein functions, e.g. binding site, ca...
Leslie Regad, Juliette Martin, Grégory Nuel...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 3 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith