Sciweavers

65 search results - page 11 / 13
» An Error Bound Based on a Worst Likely Assignment
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
An approximate Minimum MOSPA estimator
Optimizing over a variant of the Mean Optimal Subpattern Assignment (MOSPA) metric is equivalent to optimizing over the track accuracy statistic often used in target tracking benc...
David Frederic Crouse, Peter Willett, Marco Guerri...
EUROGRAPHICS
2010
Eurographics
13 years 7 months ago
Contrast-aware Halftoning
This paper proposes two variants of a simple but efficient algorithm for structure-preserving halftoning. Our algorithm extends Floyd-Steinberg error diffusion; the goal of our ex...
Hua Li and David Mould
PDCN
2004
13 years 7 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
CPAIOR
2008
Springer
13 years 7 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
ECCV
2002
Springer
14 years 7 months ago
Visual Data Fusion for Objects Localization by Active Vision
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
François Chaumette, Grégory Flandin