Sciweavers

454 search results - page 54 / 91
» Visualization of Program Dependence Graphs
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
PAMI
2010
103views more  PAMI 2010»
14 years 8 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
SEMCO
2009
IEEE
15 years 4 months ago
Using a Formal Language Constructs for Software Model Evolution
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...
Samuel A. Ajila, Shahid Alam
ECOOP
2006
Springer
15 years 1 months ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
PLDI
2011
ACM
14 years 16 days ago
Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors
MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typ...
Ashwin Prasad, Jayvant Anantpur, R. Govindarajan