2031 search results - page 30 / 407 » On Tree-Constrained Matchings and Generalizations |
126
click to vote
CCR
2010
14 years 11 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
120
click to vote
COLING
2010
14 years 8 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
105
click to vote
3DIM
1997
IEEE
15 years 6 months ago
1997
IEEE
For registration of 3-D free-form surfaces we have developed a representation which requires no knowledge of the transformation between views. The representation comprises descrip...
137
Voted
ISAAC
2000
Springer
15 years 5 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
104
Voted
AAAI
2006
15 years 3 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...