Sciweavers

226 search results - page 29 / 46
» A Tutorial on Analog Computation: Computing Functions over t...
Sort
View
AROBOTS
2002
91views more  AROBOTS 2002»
13 years 7 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
CVPR
2004
IEEE
14 years 9 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
ICS
2010
Tsinghua U.
14 years 4 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CVPR
2010
IEEE
14 years 1 months ago
Group MRF for fMRI Activation Detection
Noise confounds present serious complications to accurate data analysis in functional magnetic resonance imaging (fMRI). Simply relying on contextual image information often resul...
Bernard Ng, Rafeef Abugharbieh, Ghassan Hamarneh
ICPR
2010
IEEE
13 years 11 months ago
Kernel-Based Implicit Regularization of Structured Objects
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
François-Xavier Dupé, Sébastien Bougleux, Luc B...