Sciweavers

829 search results - page 87 / 166
» Distance domination-critical graphs
Sort
View
JCB
2006
115views more  JCB 2006»
14 years 12 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
BMCBI
2008
200views more  BMCBI 2008»
15 years 13 hour ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
91
Voted
AAAI
2004
15 years 1 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
JCT
2006
80views more  JCT 2006»
14 years 12 months ago
Extending precolorings to circular colorings
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...
Michael O. Albertson, Douglas B. West
96
Voted
WWW
2002
ACM
16 years 17 days ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...