Sciweavers

71 search results - page 3 / 15
» Compressing Large Signature Trees
Sort
View
PVLDB
2010
136views more  PVLDB 2010»
13 years 4 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
CORR
2011
Springer
124views Education» more  CORR 2011»
13 years 8 days ago
Parallel Recursive State Compression for Free
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 17 days ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
PAIRING
2010
Springer
155views Cryptology» more  PAIRING 2010»
13 years 3 months ago
Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
Brian J. Matt
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 7 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian