Sciweavers

874 search results - page 30 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
OPODIS
2001
13 years 9 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
ECCV
2010
Springer
13 years 11 months ago
A Novel Parameter Estimation Algorithm for the Multivariate t-Distribution and Its Application to Computer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
AAAI
1998
13 years 9 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
J. Ross Beveridge
IJCAI
1989
13 years 8 months ago
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms
Despite the fact that many symbolic and connectionist (neural net) learning algorithms are addressing the same problem of learning from classified examples, very little Is known r...
Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. To...