2994 search results - page 366 / 599 » Time sequences |
130
Voted
CCCG
2010
15 years 5 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
111
Voted
BILDMED
2008
15 years 5 months ago
2008
Manual landmark positioning in volumetric image data is a complex task and often results in erroneous landmark positions. The landmark positioning tool presented uses image curvatu...
118
Voted
BIS
2007
15 years 5 months ago
2007
Abstract. Use cases are a popular way of specifying functional requirements of computer-based systems. Each use case contains a sequence of steps which are described with a natural...
118
Voted
CCCG
2007
15 years 5 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
146
Voted
ICMLA
2007
15 years 5 months ago
2007
We develop an optical flow estimation framework that focuses on motion estimation over time formulated in a Dynamic Bayesian Network. It realizes a spatiotemporal integration of ...