Sciweavers

561 search results - page 1 / 113
» Shortest-Path Kernels on Graphs
Sort
View
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
13 years 10 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 4 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
SLS
2009
Springer
250views Algorithms» more  SLS 2009»
13 years 11 months ago
Running Time Analysis of ACO Systems for Shortest Path Problems
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
Christian Horoba, Dirk Sudholt
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
SIAMDM
2010
99views more  SIAMDM 2010»
12 years 11 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong