Sciweavers

1578 search results - page 46 / 316
» Algorithmic randomness of continuous functions
Sort
View
IDA
1999
Springer
14 years 3 months ago
Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
Mayer Aladjem
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
14 years 3 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 11 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
AAAI
2004
14 years 12 days ago
On the Optimality of Probability Estimation by Random Decision Trees
Random decision tree is an ensemble of decision trees. The feature at any node of a tree in the ensemble is chosen randomly from remaining features. A chosen discrete feature on a...
Wei Fan
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
14 years 3 months ago
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
Miguel Nicolau