Sciweavers

1845 search results - page 104 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
14 years 3 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 11 months ago
Optimal Random Matchings on Trees and Applications
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
Jeff Abrahamson, Béla Csaba, Ali Shokoufand...
EGC
2005
Springer
14 years 3 months ago
A Grid-Oriented Genetic Algorithm
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
Jose Herrera, Eduardo Huedo, Rubén S. Monte...
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 3 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
IJON
2007
80views more  IJON 2007»
13 years 9 months ago
Hardware implementation of a novel genetic algorithm
—This paper presents a novel genetic algorithm, termed the Optimum Individual Monogenetic Algorithm (OIMGA) and describes its hardware implementation. As the monogenetic strategy...
Z. Zhu, D. J. Mulvaney, Vassilios A. Chouliaras