Sciweavers

721 search results - page 40 / 145
» Almost universal graphs
Sort
View
JCT
2008
57views more  JCT 2008»
15 years 24 days ago
Invariant boundary distributions for finite graphs
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
Guyan Robertson
115
Voted
MFPS
1993
15 years 4 months ago
A Chemical Abstract Machine for Graph Reduction
al abstract machine for graph reduction Alan Jeffrey Report 3/92 August 1992 Computer Science School of Cognitive and Computing Sciences University of Sussex Brighton BN1 9QH ISSN ...
Alan Jeffrey
79
Voted
AUSDM
2007
Springer
76views Data Mining» more  AUSDM 2007»
15 years 7 months ago
Evaluation of a Graduate Level Data Mining Course with Industry Participants
Data mining courses are increasingly being taught at many universities at both undergraduate and graduate levels. This paper reports on a new graduate level data mining course run...
Peter Christen
79
Voted
UAIS
2002
77views more  UAIS 2002»
15 years 13 days ago
Dialoguing with developers and suppliers of adaptive computer technologies: Data and recommendations
The authors report on findings on computer technology needs and concerns of 725 Canadian college and university students with a wide range of disabilities. The vast majority of thi...
Jennison V. Asuncion, Catherine S. Fichten, Myrtis...
100
Voted
ICAPR
2005
Springer
15 years 6 months ago
The RW2 Algorithm for Exact Graph Matching
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
Marco Gori, Marco Maggini, Lorenzo Sarti