5169 search results - page 136 / 1034 » Locality approximation using time |
154
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
143
click to vote
COR
2006
15 years 4 months ago
2006
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
141
click to vote
WINE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
123
click to vote
SIAMCO
2000
15 years 4 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
135
click to vote
BIBE
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...