Sciweavers

2424 search results - page 51 / 485
» A general algorithm for data dependence analysis
Sort
View
STACS
1995
Springer
15 years 6 months ago
Generalized Scans and Tri-Diagonal Systems
Motivatedby the analysis of known parallel techniques for the solution of linear tridiagonal system, we introduce generalized scans, a class of recursively de ned lengthpreserving...
Paul F. Fischer, Franco P. Preparata, John E. Sava...
COGSCI
2010
107views more  COGSCI 2010»
15 years 2 months ago
Feature Selection for Inductive Generalization
Judging similarities among objects, events, and experiences is one of the most basic cognitive abilities, allowing us to make predictions and generalizations. The main assumption ...
Na-Yung Yu, Takashi Yamauchi, Huei-Fang Yang, Yen-...
MOBIHOC
2008
ACM
16 years 2 months ago
Toward stochastic anatomy of inter-meeting time distribution under general mobility models
Recent discovery of the mixture (power-law and exponential) behavior of inter-meeting time distribution of mobile nodes presents new challenge to the problem of mobility modeling ...
Han Cai, Do Young Eun
IJPP
1998
91views more  IJPP 1998»
15 years 2 months ago
Reuse-Driven Tiling for Improving Data Locality
This paper applies unimodular transformations and tiling to improve data locality of a loop nest. Due to data dependences and reuse information, not all dimensions of the iteration...
Jingling Xue, Chua-Huang Huang
SIGSOFT
2002
ACM
16 years 3 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...