Sciweavers

140 search results - page 10 / 28
» String Quartets In Binary
Sort
View
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
14 years 10 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
INFOCOM
2010
IEEE
14 years 8 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 4 months ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
ICDAR
2005
IEEE
15 years 3 months ago
Unconstrained Numeral Pair Recognition Using Enhanced Error Correcting Output Coding: A Holistic Approach
– This paper describes a new approach to recognize touching numeral strings. Currently most methods for numeral string recognition require segmenting the string image into separa...
Jie Zhou, Ching Y. Suen