Sciweavers

906 search results - page 57 / 182
» Matching Subsequences in Trees
Sort
View
CVPR
2006
IEEE
14 years 11 months ago
Extracting Subimages of an Unknown Category from a Set of Images
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
Sinisa Todorovic, Narendra Ahuja
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 9 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
PAMI
2006
168views more  PAMI 2006»
13 years 9 months ago
Graphical Models and Point Pattern Matching
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Tibério S. Caetano, Terry Caelli, Dale Schu...
ICDAR
2005
IEEE
14 years 2 months ago
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...
ECAI
2008
Springer
13 years 10 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...