144 search results - page 13 / 29 » Throughput Analysis of Synchronous Data Flow Graphs |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper presents a methodology to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall performance ...
ACSC
2006
IEEE
13 years 11 months ago
2006
IEEE
Communications devices intended for use in securitycritical applications must be rigorously evaluated to ensure they preserve data confidentiality. This process includes tracing t...
JDA
2006
13 years 7 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
BMCBI
2005
13 years 7 months ago
2005
Background: Single Nucleotide Polymorphism (SNP) genotyping is a major activity in biomedical research. The Taqman technology is one of the most commonly used approaches. It produ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...