1093 search results - page 119 / 219 » Crossover in Probability Spaces |
APPROX
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
ECCV
2008
Springer
15 years 16 days ago
2008
Springer
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
ECCV
2004
Springer
15 years 16 days ago
2004
Springer
Abstract We propose an approach to texture boundary detection that only requires a line-search in the direction normal to the edge. It is therefore very fast and can be incorporate...
ICPR
2006
IEEE
14 years 11 months ago
2006
IEEE
In this paper, we present a novel method for model estimation for visual servoing. This method employs a particle filter algorithm to estimate the depth of the image features onli...
DAC
2002
ACM
14 years 11 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...