1884 search results - page 132 / 377 » Simple Algorithm for Simple Timed Games |
150
click to vote
BILDMED
2007
15 years 7 months ago
2007
The transformation from an ultrasound (US) image plane to the coordinate system of a position sensor attached to the US transducer can be computed with US calibration algorithms. T...
185
click to vote
DGCI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
168
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
190
click to vote
CATS
1998
15 years 7 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
151
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...