Sciweavers

36 search results - page 4 / 8
» Labeling trees with a condition at distance two
Sort
View
ICALP
2007
Springer
14 years 1 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
BMCBI
2006
127views more  BMCBI 2006»
13 years 7 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
ACL
2012
11 years 10 months ago
Extracting Narrative Timelines as Temporal Dependency Structures
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
Oleksandr Kolomiyets, Steven Bethard, Marie-Franci...
PKDD
2007
Springer
91views Data Mining» more  PKDD 2007»
14 years 1 months ago
Domain Adaptation of Conditional Probability Models Via Feature Subsetting
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
Sandeepkumar Satpal, Sunita Sarawagi
ISCAS
2008
IEEE
136views Hardware» more  ISCAS 2008»
14 years 2 months ago
Spatial-temporal consistent labeling for multi-camera multi-object surveillance systems
Abstract—For an intelligent multi-camera multi-object surveillance system, object correspondence across time and space is important to many smart visual applications. In this pap...
Jing-Ying Chang, Tzu-Heng Wang, Shao-Yi Chien, Lia...