Sciweavers

13214 search results - page 48 / 2643
» Pseudorandomness for network algorithms
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 6 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
CORR
2011
Springer
217views Education» more  CORR 2011»
15 years 1 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...
TRIDENTCOM
2008
IEEE
16 years 15 days ago
A case study in testing a network security algorithm
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
Carrie Gates
IJCAI
2001
15 years 7 months ago
Genetic Algorithm based Selective Neural Network Ensemble
Neural network ensemble is a learning paradigm where several neural networks are jointly used to solve a problem. In this paper, the relationship between the generalization abilit...
Zhi-Hua Zhou, Jianxin Wu, Yuan Jiang, Shifu Chen
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 8 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar