Sciweavers

1882 search results - page 149 / 377
» Transformational Programming and Forests
Sort
View
IJCAI
1989
14 years 11 months ago
Program Derivation Using Analogy
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...
Mehdi T. Harandi, Sanjay Bhansali
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
PLDI
2003
ACM
15 years 3 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
INFOCOM
2011
IEEE
14 years 1 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
MM
2009
ACM
144views Multimedia» more  MM 2009»
15 years 4 months ago
Manipulating lossless video in the compressed domain
A compressed-domain transformation is one that operates directly on the compressed format, rather than requiring conversion to an uncompressed format prior to processing. Performi...
William Thies, Steven Hall, Saman P. Amarasinghe