4926 search results - page 54 / 986 » Two Graph Algorithms On an Associative Computing Model |
NIPS
2003
13 years 9 months ago
2003
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
DAC
2009
ACM
13 years 11 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...