Sciweavers

561 search results - page 92 / 113
» Shortest-Path Kernels on Graphs
Sort
View
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 8 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
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
PPOPP
2010
ACM
14 years 2 months ago
An adaptive performance modeling tool for GPU architectures
This paper presents an analytical model to predict the performance of general-purpose applications on a GPU architecture. The model is designed to provide performance information ...
Sara S. Baghsorkhi, Matthieu Delahaye, Sanjay J. P...
CATS
2008
13 years 8 months ago
Parameterized Complexity of the Clique Partition Problem
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Egbert Mujuni, Frances A. Rosamond
IJON
2006
87views more  IJON 2006»
13 years 7 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...