We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...