Sciweavers

417 search results - page 8 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
LCPC
1991
Springer
13 years 11 months ago
An Executable Representation of Distance and Direction
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
Richard Johnson, Wei Li, Keshav Pingali
LCPC
1999
Springer
13 years 11 months ago
An Empirical Study of Function Pointers Using SPEC Benchmarks
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
Ben-Chung Cheng, Wen-mei W. Hwu
PR
2010
145views more  PR 2010»
13 years 5 months ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
DIAGRAMS
2008
Springer
13 years 9 months ago
Supporting Reasoning and Problem-Solving in Mathematical Generalisation with Dependency Graphs
Abstract. We present a brief description of the design of a diagrambased system that supports the development of thinking about mathematical generalisation. Within the software, th...
Sergio Gutiérrez Santos, Darren Pearce, Eir...