1942 search results - page 161 / 389 » HINT: A new way to measure computer performance |
189
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
220
click to vote
FOGA
2011
14 years 10 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
183
click to vote
IPMI
2009
Springer
16 years 1 months ago
2009
Springer
This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is r...
207
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
167
click to vote
HPCC
2010
Springer
15 years 6 months ago
2010
Springer
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...