Sciweavers

2270 search results - page 92 / 454
» On the distribution of eigenvalues of graphs
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ICML
2007
IEEE
16 years 7 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
TEI
2009
ACM
103views Hardware» more  TEI 2009»
16 years 1 months ago
A tangible construction kit for exploring graph theory
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...
Eric Schweikardt, Nwanua Elumeze, Michael Eisenber...
FOCS
2007
IEEE
16 years 18 days ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
IV
2005
IEEE
156views Visualization» more  IV 2005»
15 years 12 months ago
Applying Graphical Design Techniques to Graph Visualisation
This paper contains details of new criteria for graph layout, based on the concepts used in graphical design. Current graph layout criteria have been shown to be effective in meas...
Martyn Taylor, Peter Rodgers