Sciweavers

1664 search results - page 62 / 333
» Distance labeling in graphs
Sort
View
ESA
1998
Springer
175views Algorithms» more  ESA 1998»
15 years 4 months ago
Computing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Philip N. Klein
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 6 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
INFOCOM
2003
IEEE
15 years 5 months ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
JSS
2008
139views more  JSS 2008»
14 years 12 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
COCOC
1995
150views Combinatorics» more  COCOC 1995»
15 years 3 months ago
On Central Spanning Trees of a Graph
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
Sergei L. Bezrukov, Firoz Kaderali, W. Poguntke