Sciweavers

5580 search results - page 57 / 1116
» Randomized priority algorithms
Sort
View
ICIP
2009
IEEE
14 years 7 months ago
Random swap EM algorithm for finite mixture models in image segmentation
The Expectation-Maximization (EM) algorithm is a popular tool in statistical estimation problems involving incomplete data or in problems which can be posed in a similar form, suc...
Qinpei Zhao, Ville Hautamäki, Ismo Kärkk...
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 3 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
TSP
2008
134views more  TSP 2008»
14 years 9 months ago
Computational Algorithms for Wavelet Identification of Nonlinearities in Hammerstein Systems With Random Inputs
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
Przemyslaw Sliwinski, Zygmunt Hasiewicz
TCS
1998
14 years 9 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
SPDP
1991
IEEE
15 years 1 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari