1272 search results - page 87 / 255 » Approximate Parameterized Matching |
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
DCC
1998
IEEE
15 years 3 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
75
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
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...
CSDA
2007
14 years 11 months ago
2007
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
ML
2002
ACM
14 years 11 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...