Sciweavers

1578 search results - page 150 / 316
» Algorithmic randomness of continuous functions
Sort
View
TVCG
2010
162views more  TVCG 2010»
13 years 8 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ICML
2009
IEEE
14 years 11 months ago
Curriculum learning
Humans and animals learn much better when the examples are not randomly presented but organized in a meaningful order which illustrates gradually more concepts, and gradually more ...
Jérôme Louradour, Jason Weston, Ronan...
COLT
1999
Springer
14 years 2 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 1 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
ICC
2007
IEEE
105views Communications» more  ICC 2007»
14 years 1 months ago
Multiuser Discrete Bit-loading for Digital Subscriber Lines
This paper proposes an efficient algorithm that produces near-optimal discrete bit-loading for a Gaussian interference channel that models a DSL network. It first takes a continuou...
David D. Yu, Kibeom Seong, John M. Cioffi