Sciweavers

1154 search results - page 20 / 231
» On the editing distance of graphs
Sort
View
GBRPR
2009
Springer
15 years 6 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
SPE
2008
91views more  SPE 2008»
14 years 11 months ago
A multiple layer model to compare RNA secondary structures
composed of various graphs linked together by relations of abstraction/refinement. The new structure is useful for representing information that can be described at t levels of abs...
Julien Allali, Marie-France Sagot
IAAI
2003
15 years 1 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
CIVR
2005
Springer
15 years 5 months ago
EMD-Based Video Clip Retrieval by Many-to-Many Matching
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
Yuxin Peng, Chong-Wah Ngo
ECAI
2008
Springer
15 years 1 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...