498 search results - page 8 / 100 » Experimental comparison of the two Fredman-Khachiyan-algorit... |
ALENEX
2004
13 years 8 months ago
2004
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for Wireless Personal Area networks (WPANs) based on current IEEE 802.1...
CLASSIFICATION
2010
13 years 4 months ago
2010
: The issue of determining "the right number of clusters" in K-Means has attracted considerable interest, especially in the recent years. Cluster intermix appears to be a...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...