Sciweavers

309 search results - page 31 / 62
» Edit distance between two RNA structures
Sort
View
ICMCS
2005
IEEE
162views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Clustering of Video Objects by Graph Matching
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider main...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
STACS
2001
Springer
14 years 8 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
BPM
2006
Springer
166views Business» more  BPM 2006»
13 years 11 months ago
Process Mining by Measuring Process Block Similarity
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
Joonsoo Bae, James Caverlee, Ling Liu, Hua Yan
SWWS
2008
13 years 9 months ago
A Harmony based Adaptive Ontology Mapping Approach
- Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. Ontology mapping is critical to achieve semantic interoperability in the...
Ming Mao, Yefei Peng, Michael Spring
BMCBI
2006
192views more  BMCBI 2006»
13 years 8 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...