Sciweavers

6248 search results - page 395 / 1250
» Programming in a data factory
Sort
View
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
16 years 11 days ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
EUROPAR
2004
Springer
16 years 6 days ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
ANSS
2004
IEEE
15 years 10 months ago
A Self Manageable Infrastructure for Supporting Web-based Simulations
Imagine if you would like to deploy your new simulation online and your systems can just take care of itself. Needed web interface could be generated, database schema objects coul...
Yingping Huang, Xiaorong Xiang, Gregory R. Madey
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 5 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
DAC
2004
ACM
16 years 7 months ago
Data compression for improving SPM behavior
Scratch-pad memories (SPMs) enable fast access to time-critical data. While prior research studied both static and dynamic SPM management strategies, not being able to keep all ho...
Ozcan Ozturk, Mahmut T. Kandemir, I. Demirkiran, G...