Sciweavers

5539 search results - page 45 / 1108
» What can be computed locally
Sort
View
ECCV
2010
Springer
14 years 2 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
ICRA
1995
IEEE
65views Robotics» more  ICRA 1995»
14 years 1 months ago
Robot Localization Using a Computer Vision Sextant
This paper explores the possibility of using Sun altitude for localization of a robot in totally unknown territory. A set of Sun altitudes is obtained by processing a sequence of ...
Fabio Gagliardi Cozman, Eric Krotkov
ICAPR
2009
Springer
14 years 4 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
IWANN
2001
Springer
14 years 2 months ago
A Realistic Computational Model of the Local Circuitry of the Cuneate Nucleus
Abstract. Intracellular recordings obtained under cutaneous and lemniscal stimulation show that the afferent fibers can establish excitatory and inhibitory synaptic connections w...
Eduardo Sánchez Vila, Senén Barro, J...
PAMI
2012
12 years 10 days ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...