Sciweavers

6365 search results - page 76 / 1273
» Fast Local Computation Algorithms
Sort
View
ICIP
2007
IEEE
15 years 8 months ago
Fast Blotch Detection Algorithm for Degraded Film Sequences Based on MRF Models
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
Sang-Churl Nam, Masahide Abe, Masayuki Kawamata
142
Voted
CVPR
2012
IEEE
13 years 4 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn
115
Voted
JCSS
2010
105views more  JCSS 2010»
15 years 26 days ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich
ICRA
2007
IEEE
139views Robotics» more  ICRA 2007»
15 years 8 months ago
Evaluating the Roomba: A low-cost, ubiquitous platform for robotics research and education
— This paper presents the iRobot corporation’s Roomba vacuum as a low-cost resource for robotics research and education. Sensor and actuation models for unmodified Roombas are...
Ben Tribelhorn, Zachary Dodds
DAC
1995
ACM
15 years 6 months ago
An Efficient Algorithm for Local Don't Care Sets Calculation
Shih-Chieh Chang, Malgorzata Marek-Sadowska, Kwang...