Sciweavers

10608 search results - page 285 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TNN
2010
234views Management» more  TNN 2010»
14 years 7 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
161
Voted
FOGA
1998
15 years 1 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
68
Voted
ICC
2007
IEEE
122views Communications» more  ICC 2007»
15 years 7 months ago
Code-Aided ML Ambiguity Resolution
Abstract— This paper deals with code-aided (CA) maximumlikelihood (ML) phase and timing ambiguity resolution. We propose a methodology based on the sum-product algorithm (SPA) to...
Cédric Herzet, Luc Vandendorpe
126
Voted
HIS
2008
15 years 2 months ago
Genetic-Based Synthetic Data Sets for the Analysis of Classifiers Behavior
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
Núria Macià, Albert Orriols-Puig, Es...
89
Voted
WSCG
2001
98views more  WSCG 2001»
15 years 1 months ago
Geometric Simplification for Efficient Occlusion Culling in Urban Scenes
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
Rick Germs, Frederik W. Jansen