Sciweavers

1154 search results - page 43 / 231
» On the editing distance of graphs
Sort
View
DOCENG
2008
ACM
13 years 10 months ago
Similarity of XML schema definitions
In this paper we propose a technique for evaluating similarity of XML Schema fragments. Firstly, we define classes of structurally and semantically equivalent XSD constructs. Then...
Irena Mlýnková
APPML
2004
79views more  APPML 2004»
13 years 8 months ago
Distance regularity of compositions of graphs
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
Dragan Stevanovic
FOCS
2009
IEEE
14 years 3 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
EJC
2008
13 years 8 months ago
Fractional chromatic number of distance graphs generated by two-interval sets
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
Daphne Der-Fen Liu, Xuding Zhu
OSDI
2008
ACM
14 years 9 months ago
Finding Similar Failures Using Callstack Similarity
We develop a machine-learned similarity metric for Windows failure reports using telemetry data gathered from clients describing the failures. The key feature is a tuned callstack...
Kevin Bartz, Jack W. Stokes, John C. Platt, Ryan K...