Sciweavers

1632 search results - page 131 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 3 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
GECCO
2010
Springer
174views Optimization» more  GECCO 2010»
15 years 7 months ago
Real-coded genetic algorithm benchmarked on noiseless black-box optimization testbed
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...
Thanh-Do Tran, Gang-Gyoo Jin
DAGM
2005
Springer
15 years 9 months ago
A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
Eric Wahl, Gerd Hirzinger
144
Voted
COLT
1998
Springer
15 years 8 months ago
Large Margin Classification Using the Perceptron Algorithm
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
Yoav Freund, Robert E. Schapire