Sciweavers

1191 search results - page 116 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed
3DIM
2001
IEEE
15 years 1 months ago
Range Image Registration: A Software Platform and Empirical Evaluation
Building 3D models of real-world objects by assembling views taken by a range sensor promises to be a more efficient method than manually producing CAD drawings. In this technique...
Gerald Dalley, Patrick J. Flynn
COLT
1995
Springer
15 years 1 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
CORR
2010
Springer
159views Education» more  CORR 2010»
14 years 10 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
15 years 4 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...