Sciweavers

2715 search results - page 285 / 543
» Total Generalized Variation
Sort
View
IANDC
2006
126views more  IANDC 2006»
15 years 4 months ago
Coalgebraic semantics for timed processes
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
Marco Kick, John Power, Alex Simpson
COMGEO
2007
ACM
15 years 4 months ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
TOC
2008
104views more  TOC 2008»
15 years 4 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
104
Voted
EATCS
2002
62views more  EATCS 2002»
15 years 3 months ago
Crossing the Bridge at Night
We solve the general case of the bridge-crossing puzzle. 1 The Puzzle Four people begin on the same side of a bridge. You must help them across to the other side. It is night. The...
Günter Rote
COR
2008
142views more  COR 2008»
15 years 3 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma