1162 search results - page 166 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ER
2004
Springer
14 years 1 months ago
2004
Springer
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
CODES
2010
IEEE
13 years 6 months ago
2010
IEEE
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
TCAD
1998
13 years 7 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
SAC
2003
ACM
14 years 1 months ago
2003
ACM
An increasing interest in the design of mobile robots has been observed in recent years, which is mainly motivated by technological advances that may allow their application to co...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...