Sciweavers

5169 search results - page 91 / 1034
» Locality approximation using time
Sort
View
VMV
2008
165views Visualization» more  VMV 2008»
15 years 4 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 8 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
113
Voted
ICC
2007
IEEE
15 years 8 months ago
Soft Estimation of Time-Varying Frequency Selective Channels Using Kalman Smoothing
— This paper addresses soft estimation of time-varying frequency selective channels using Kalman smoothing. The proposed estimator uses soft extrinsic information provided by a c...
Valery Ramon, Cédric Herzet, Xavier Wautele...
94
Voted
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
15 years 6 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 5 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha