57 search results - page 9 / 12 » On-Line Approximate String Matching with Bounded Errors |
DATE
1999
IEEE
13 years 12 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
MOC
2011
13 years 2 months ago
2011
Abstract. Local energy error estimates for the finite element method for elliptic problems were originally proved in 1974 by Nitsche and Schatz. These estimates show that the loca...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
ICALP
2001
Springer
14 years 2 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...