387 search results - page 9 / 78 » Reasoning About Approximate Match Query Results |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
KR
2004
Springer
14 years 25 days ago
2004
Springer
In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontolog...
IIS
2003
13 years 8 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
ECCV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. A novel hybrid region-based and contour-based multiple object tracking model using optical flow based elastic matching is proposed. The proposed elastic matching model is...
CPM
1998
Springer
13 years 11 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...