Sciweavers

323 search results - page 33 / 65
» Dualizability and graph algebras
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
JALC
2002
97views more  JALC 2002»
13 years 7 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
IJSI
2008
126views more  IJSI 2008»
13 years 7 months ago
Modelling Route Instructions for Robust Human-Robot Interaction on Navigation Tasks
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
Hui Shi, Bernd Krieg-Brückner
EUROPAR
1998
Springer
13 years 12 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
RSA
2002
81views more  RSA 2002»
13 years 7 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou