Sciweavers

10608 search results - page 637 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
WDAG
2005
Springer
85views Algorithms» more  WDAG 2005»
16 years 21 days ago
Time and Space Lower Bounds for Implementations Using k-CAS
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
Hagit Attiya, Danny Hendler
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 11 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
ACL
1994
15 years 8 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
ICIP
2008
IEEE
16 years 9 months ago
The Marr wavelet pyramid
We introduce a new semi-orthogonal complex wavelet basis of L2(R2 ). The basis functions are associated to the complex gradient-Laplace operator, which plays a central role in ima...
Dimitri Van De Ville, Michael Unser
ICPR
2008
IEEE
16 years 8 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...