Sciweavers

29 search results - page 4 / 6
» Liveness and Boundedness of Synchronous Data Flow Graphs
Sort
View
FORTE
1994
13 years 9 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue
ASPDAC
2000
ACM
131views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Reconfigurable synchronized dataflow processor
- This paper describes the design and implementation of a reconfigurable synchronized dataflow processor (RSDP). The RSDP can configure its hardware to directly represent dataflow ...
Hiroshi Sasaki, Hitoshi Maruyama, Hideaki Tsukioka...
CVPR
2006
IEEE
14 years 9 months ago
Bilayer Segmentation of Live Video
This paper presents an algorithm capable of real-time separation of foreground from background in monocular video sequences. Automatic segmentation of layers from colour/contrast ...
Antonio Criminisi, Geoffrey Cross, Andrew Blake, V...
ASPLOS
2008
ACM
13 years 9 months ago
Concurrency control with data coloring
Concurrency control is one of the main sources of error and complexity in shared memory parallel programming. While there are several techniques to handle concurrency control such...
Luis Ceze, Christoph von Praun, Calin Cascaval, Pa...
ISSS
1999
IEEE
151views Hardware» more  ISSS 1999»
13 years 12 months ago
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
Jens Horstmannshoff, Heinrich Meyr