Sciweavers

1232 search results - page 59 / 247
» Digraphs: theory, algorithms and applications
Sort
View
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
16 years 17 days ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
AIIA
2003
Springer
15 years 11 months ago
Improving the SLA Algorithm Using Association Rules
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
Evelina Lamma, Fabrizio Riguzzi, Andrea Stambazzi,...
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 9 months ago
A method for parameter calibration and relevance estimation in evolutionary algorithms
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
Volker Nannen, A. E. Eiben
NIPS
2001
15 years 7 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson