Sciweavers

421 search results - page 38 / 85
» String Distances and Uniformities
Sort
View
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 6 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 4 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
ANCS
2005
ACM
15 years 9 months ago
High-throughput linked-pattern matching for intrusion detection systems
This paper presents a hardware architecture for highly efficient intrusion detection systems. In addition, a software tool for automatically generating the hardware is presented....
Zachary K. Baker, Viktor K. Prasanna
STRINGOLOGY
2004
15 years 5 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
127
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot