Sciweavers

4041 search results - page 150 / 809
» time 2009
Sort
View
FEGC
2009
86views Biometrics» more  FEGC 2009»
15 years 4 months ago
Binary Sequences and Association Graphs for Fast Detection of Sequential Patterns
We develop an efficient algorithm for detecting frequent patterns that occur in sequence databases under certain constraints. By combining the use of bit vector representations of ...
Selim Mimaroglu, Dan A. Simovici
DCC
2009
IEEE
16 years 7 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
EUROCRYPT
2009
Springer
16 years 7 months ago
Cryptanalysis of MDC-2
We provide a collision attack and preimage attacks on the MDC-2 construction, which is a method (dating back to 1988) of turning an n-bit block cipher into a 2n-bit hash function. ...
Christian Rechberger, Florian Mendel, Lars R. Knud...
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
15 years 4 months ago
DVBMN-l: delay variation bounded multicast network with multiple paths
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as Delay and Delay Variation Bound so that the messages reac...
Abhishek Bhattacharya, Zhenyu Yang
FASE
2009
Springer
16 years 1 months ago
Reducing the Costs of Bounded-Exhaustive Testing
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...