Sciweavers

620 search results - page 36 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
131
Voted
IJCV
2000
109views more  IJCV 2000»
15 years 2 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
155
Voted
JMIV
2011
179views more  JMIV 2011»
14 years 9 months ago
3-D Data Denoising and Inpainting with the Low-Redundancy Fast Curvelet Transform
In this paper, we first present a new implementation of the 3-D fast curvelet transform, which is nearly 2.5 less redundant than the Curvelab (wrapping-based) implementation as o...
A. Woiselle, Jean-Luc Starck, Jalal Fadili
113
Voted
ICML
2003
IEEE
16 years 3 months ago
Tackling the Poor Assumptions of Naive Bayes Text Classifiers
Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely af...
Jason D. Rennie, Lawrence Shih, Jaime Teevan, Davi...
ACL
2008
15 years 4 months ago
Lexicalized Phonotactic Word Segmentation
This paper presents a new unsupervised algorithm (WordEnds) for inferring word boundaries from transcribed adult conversations. Phone ngrams before and after observed pauses are u...
Margaret M. Fleck
CDC
2008
IEEE
127views Control Systems» more  CDC 2008»
15 years 9 months ago
Distributed control: A sequentially semi-separable approach
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
Justin K. Rice, Michel Verhaegen