Sciweavers

6365 search results - page 16 / 1273
» Fast Local Computation Algorithms
Sort
View
ISVC
2009
Springer
15 years 4 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
ICRA
1999
IEEE
126views Robotics» more  ICRA 1999»
15 years 2 months ago
Monte Carlo Localization for Mobile Robots
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
Frank Dellaert, Dieter Fox, Wolfram Burgard, Sebas...
ICCV
2005
IEEE
15 years 3 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
ICASSP
2011
IEEE
14 years 1 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa
DIS
2006
Springer
15 years 1 months ago
A New Family of String Classifiers Based on Local Relatedness
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masay...