Sciweavers

6365 search results - page 184 / 1273
» Fast Local Computation Algorithms
Sort
View
ICRA
2000
IEEE
99views Robotics» more  ICRA 2000»
15 years 10 months ago
Sensor Resetting Localization for Poorly Modelled Mobile Robots
We present a new localization algorithm called Sensor Resetting Localization which is an extension of Monte Carlo Localization. The algorithm adds sensor based resampling to Monte...
Scott Lenser, Manuela M. Veloso
CVPR
2011
IEEE
15 years 2 months ago
Fast Cost-Volume Filtering for Visual Correspondence and Beyond
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
Christoph Rhemann, Asmaa Hosni, Michael Bleyer, Ca...
189
Voted
CGF
2011
15 years 1 months ago
A Survey of Real-Time Hard Shadow Mapping Methods
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
Daniel Scherzer, Michael Wimmer, Werner Purgathofe...
TMC
2010
179views more  TMC 2010»
15 years 4 months ago
On Fast and Accurate Detection of Unauthorized Wireless Access Points Using Clock Skews
We explore the use of clock skew of a wireless local area network access point (AP) as its fingerprint to detect unauthorized APs quickly and accurately. The main goal behind usi...
Suman Jana, Sneha Kumar Kasera
IJCV
2002
256views more  IJCV 2002»
15 years 5 months ago
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
Changming Sun