1039 search results - page 174 / 208 » Kernels and Regularization on Graphs |
192
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
100
click to vote
ICPP
2009
IEEE
15 years 6 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
110
click to vote
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
ICSM
2007
IEEE
15 years 6 months ago
2007
IEEE
The build system forms an indispensable part of any software project. It needs to evolve in parallel with the source code in order to build, test and install the software. Unfortu...
118
click to vote
ECRTS
2010
IEEE
15 years 27 days ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...