580 search results - page 42 / 116 » Approximation Algorithms for Temporal Reasoning |
122
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
128
click to vote
EMSOFT
2004
Springer
15 years 7 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
123
click to vote
CD
2005
Springer
15 years 8 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
115
click to vote
CIVR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The location of video scenes is an important semantic descriptor especially for broadcast news video. In this paper, we propose a learning-based approach to annotate shot...
162
click to vote
NCA
2008
IEEE
15 years 2 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...