672 search results - page 90 / 135 » A General Solution to the Graph History Interaction Problem |
EMSOFT
2006
Springer
14 years 11 days ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 8 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
ACMACE
2009
ACM
14 years 1 months ago
2009
ACM
How do games effect the way we problem solve, socialize, or even view the world? When we shoot do we learn to destroy obstacles instead of work around them? Does the binary world ...
IWCIA
2004
Springer
14 years 2 months ago
2004
Springer
We consider selected geometric properties of 2D or 3D sets, given in form of binary digital pictures, and discuss their estimation. The properties examined are perimeter and area i...
SDL
2007
13 years 10 months ago
2007
Abstract. OpenComRTOS is one of the few Real-Time Operating Systems (RTOS) for embedded systems that was developed using formal modeling techniques. The goal was to obtain a proven...