3212 search results - page 266 / 643 » Faster Concept Analysis |
180
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
169
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
179
click to vote
ASPLOS
2010
ACM
15 years 5 months ago
2010
ACM
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
214
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
i In this paper, we identify the unique challenges in deploying parallelism on TCAM-based pattern matching for Network Intrusion Detection Systems (NIDSes). We resolve two critica...
211
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...