36 search results - page 3 / 8 » Partially directed paths in a wedge |
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
stract setting. Then we instantiate this algorithm with specific partial orderings and functions to obtain specific constraint propagation algorithms. In particular, using the noti...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
JDA
2006
14 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
RT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Photo-realistic rendering algorithms such as Monte Carlo ray tracing sample individual paths to compute images. Noise and aliasing artefacts are usually reduced by supers...