6110 search results - page 793 / 1222 » Approximate Computing |
168
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
We propose a novel efficient algorithm for robust tracking of a fixed number of targets in real-time with low failure rate. The method is an instance of Sequential Importance Resa...
148
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
177
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
173
click to vote
MIDDLEWARE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
178
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We wish to recover an image corrupted by blur and Gaussian or impulse noise, in a variational framework. We use two data-fidelity terms depending on the noise, and sever...