4137 search results - page 191 / 828 » On the number of matchings of a tree |
137
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
Higher transistor transition frequencies, lower supply voltages and smaller physical dimensions are, nowadays, general trends in the semiconductor industry. Operating at lower sup...
181
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
162
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In...
163
click to vote
DEBS
2010
ACM
15 years 10 months ago
2010
ACM
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
156
click to vote
ECCC
2010
15 years 6 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...