Sciweavers

2137 search results - page 118 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 4 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
TVCG
2012
182views Hardware» more  TVCG 2012»
12 years 1 months ago
Coherent Time-Varying Graph Drawing with Multifocus+Context Interaction
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
Kun-Chuan Feng, Chaoli Wang, Han-Wei Shen, Tong-Ye...
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
14 years 5 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 8 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
APPINF
2003
14 years 5 days ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker