2403 search results - page 182 / 481 » Optimal Randomized RANSAC |
170
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
147
click to vote
CGO
2008
IEEE
15 years 10 months ago
2008
IEEE
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
122
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
100
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
122
Voted
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper we address the problem of fast segmenting moving objects in video acquired by moving camera or more generally with a moving background. We present an approach based ...