1272 search results - page 32 / 255 » Approximate Parameterized Matching |
256
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
164
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
135
Voted
IMC
2006
ACM
15 years 9 months ago
2006
ACM
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
124
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
105
click to vote
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...