Sciweavers

2693 search results - page 27 / 539
» On Computing Complex Navigation Functions
Sort
View
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
14 years 4 months ago
Probabilistic Appearance Based Navigation and Loop Closing
— This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of appearance, we can compute not only the similarity o...
Mark Cummins, Paul M. Newman
RTA
2010
Springer
14 years 1 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ICCS
2004
Springer
14 years 3 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 1 months ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 4 months ago
MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn