Sciweavers

1101 search results - page 196 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
JMLR
2002
137views more  JMLR 2002»
14 years 9 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
ECAL
1995
Springer
15 years 1 months ago
Contemporary Evolution Strategies
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Hans-Paul Schwefel, Günter Rudolph
BCS
2008
14 years 11 months ago
Improved SIFT-Features Matching for Object Recognition
: The SIFT algorithm (Scale Invariant Feature Transform) proposed by Lowe [1] is an approach for extracting distinctive invariant features from images. It has been successfully app...
Faraj Alhwarin, Chao Wang, Danijela Ristic-Durrant...
DAGM
2009
Springer
15 years 1 months ago
An Efficient Linear Method for the Estimation of Ego-Motion from Optical Flow
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
Florian Raudies, Heiko Neumann
PODC
2003
ACM
15 years 2 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman