55 search results - page 11 / 11 » More Efficient Algorithms for Closest String and Substring P... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
ICDT
2010
ACM
13 years 8 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
DEBS
2007
ACM
13 years 9 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...