Sciweavers

1447 search results - page 18 / 290
» Graphs and Path Equilibria
Sort
View
GLOBECOM
2009
IEEE
15 years 6 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
15 years 5 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
2008
Springer
108views Education» more  CORR 2008»
14 years 12 months ago
Hierarchical Bag of Paths for Kernel Based Shape Classification
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
François-Xavier Dupé, Luc Brun
PODC
2006
ACM
15 years 5 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
SPAA
2005
ACM
15 years 5 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer