Sciweavers

451 search results - page 1 / 91
» Complexity of Data Flow Analysis for Non-Separable Framework...
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 4 months ago
Complexity of Data Flow Analysis for Non-Separable Frameworks
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
Bageshri Karkare, Uday P. Khedker
CC
2007
Springer
208views System Software» more  CC 2007»
13 years 10 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
SCFBM
2008
148views more  SCFBM 2008»
13 years 3 months ago
Flow: Statistics, visualization and informatics for flow cytometry
Flow is an open source software application for clinical and experimental researchers to perform exploratory data analysis, clustering and annotation of flow cytometric data. Flow...
Jacob Frelinger, Thomas B. Kepler, Cliburn Chan
RTS
2002
107views more  RTS 2002»
13 years 4 months ago
Data-Flow Frameworks for Worst-Case Execution Time Analysis
The purpose of this paper is to introduce frameworks based on data-flow equations which provide for estimating the worst-case execution time (WCET) of (real-time) programs. These f...
Johann Blieberger
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
13 years 9 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang