Sciweavers

6149 search results - page 726 / 1230
» Revealing the programming process
Sort
View
PPDP
2010
Springer
15 years 5 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
ASPLOS
2011
ACM
14 years 10 months ago
On-the-fly elimination of dynamic irregularities for GPU computing
The power-efficient massively parallel Graphics Processing Units (GPUs) have become increasingly influential for scientific computing over the past few years. However, their ef...
Eddy Z. Zhang, Yunlian Jiang, Ziyu Guo, Kai Tian, ...
ASPLOS
2012
ACM
14 years 2 months ago
Chameleon: operating system support for dynamic processors
The rise of multi-core processors has shifted performance efforts towards parallel programs. However, single-threaded code, whether from legacy programs or ones difficult to para...
Sankaralingam Panneerselvam, Michael M. Swift
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
13 years 9 months ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...
PLDI
2012
ACM
13 years 9 months ago
Design and implementation of sparse global analyses for C-like languages
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, Kw...