Sciweavers

2303 search results - page 193 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
123
Voted
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 3 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
152
Voted
CMA
2011
14 years 10 months ago
Detecting critical regions in multidimensional data sets
We propose a new approach, based on the Conley index theory, for the detection and classification of critical regions in multidimensional data sets. The use of homology groups ma...
Madjid Allili, David Corriveau, Sara Deriviè...
135
Voted
PPSN
2004
Springer
15 years 9 months ago
Statistical Racing Techniques for Improved Empirical Evaluation of Evolutionary Algorithms
In empirical studies of Evolutionary Algorithms, it is usually desirable to evaluate and compare algorithms using as many different parameter settings and test problems as possible...
Bo Yuan, Marcus Gallagher
152
Voted
BMCBI
2008
89views more  BMCBI 2008»
15 years 3 months ago
R/parallel - speeding up bioinformatics analysis with R
Background: R is the preferred tool for statistical analysis of many bioinformaticians due in part to the increasing number of freely available analytical methods. Such methods ca...
Gonzalo Vera, Ritsert C. Jansen, Remo Suppi
151
Voted
ASAP
2000
IEEE
184views Hardware» more  ASAP 2000»
15 years 8 months ago
Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter
Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the l...
Marcus Bednara, Oliver Beyer, Jürgen Teich, R...