Sciweavers

656 search results - page 5 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
NN
2008
Springer
146views Neural Networks» more  NN 2008»
14 years 9 months ago
Clustering and co-evolution to construct neural network ensembles: An experimental study
This paper introduces an approach called Clustering and Co-evolution to Construct Neural Network Ensembles (CONE). This approach creates neural network ensembles in an innovative ...
Fernanda L. Minku, Teresa Bernarda Ludermir
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 4 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
BMCBI
2005
156views more  BMCBI 2005»
14 years 9 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
SPIRE
2005
Springer
15 years 3 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
CIKM
2008
Springer
14 years 11 months ago
Ranking information resources in peer-to-peer text retrieval: an experimental study
This paper experimentally studies approaches to the problem of ranking information resources w.r.t. user queries in peer-to-peer information retrieval. In distributed environments...
Hans F. Witschel