Sciweavers

2294 search results - page 85 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ICML
2007
IEEE
15 years 10 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
PR
2008
206views more  PR 2008»
14 years 9 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu
COCOON
2006
Springer
15 years 1 months ago
Optimal Acyclic Edge Colouring of Grid Like Graphs
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
Rahul Muthu, N. Narayanan, C. R. Subramanian
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
15 years 4 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
IDA
2010
Springer
14 years 11 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou