Sciweavers

2137 search results - page 185 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ARTCOM
2009
IEEE
14 years 24 days ago
Maximizing the Efficiency of Parallel Apriori Algorithm
In this paper we attempt to maximize the efficiency of the parallel Apriori Algorithm. The paper analyzes the performance of the algorithm over different datasets and over n proce...
Ketan Shah, Sunita Mahajan
ICMLA
2008
13 years 11 months ago
New Insights into Learning Algorithms and Datasets
We report on three distinct experiments that provide new valuable insights into learning algorithms and datasets. We first describe two effective meta-features that significantly ...
Jun Won Lee, Christophe G. Giraud-Carrier
DASFAA
2009
IEEE
93views Database» more  DASFAA 2009»
14 years 4 months ago
Top-K Correlation Sub-graph Search in Graph Databases
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...
Lei Zou, Lei Chen 0002, Yansheng Lu
IPPS
1999
IEEE
14 years 1 months ago
A Parallel Adaptive version of the Block-based Gauss-Jordan Algorithm
This paper presents a parallel adaptive version of the block-based Gauss-Jordan algorithm used in numerical analysis to invert matrices. This version includes a characterization o...
Nordine Melab, El-Ghazali Talbi, Serge G. Petiton
JSAC
2008
56views more  JSAC 2008»
13 years 9 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato