Sciweavers

1559 search results - page 226 / 312
» Some Group Theory Problems
Sort
View
ICA
2012
Springer
13 years 5 months ago
Distributional Convergence of Subspace Estimates in FastICA: A Bootstrap Study
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
Jarkko Ylipaavalniemi, Nima Reyhani, Ricardo Vig&a...
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 4 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 1 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 11 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
CORR
2006
Springer
81views Education» more  CORR 2006»
14 years 10 months ago
The Workshop on Internet Topology (WIT) Report
Internet topology analysis has recently experienced a surge of interest in computer science, physics, and the mathematical sciences. However, researchers from these different disc...
Dmitri V. Krioukov, Fan R. K. Chung, Kimberly C. C...