Sciweavers

1166 search results - page 204 / 234
» Programming Language Support for Adaptable Wearable Computin...
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
IPPS
2007
IEEE
14 years 3 months ago
Invited Paper: A Compile-time Cost Model for OpenMP
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emer...
Chunhua Liao, Barbara M. Chapman
ASPLOS
2006
ACM
14 years 21 days ago
Comprehensively and efficiently protecting the heap
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...
Mazen Kharbutli, Xiaowei Jiang, Yan Solihin, Guru ...
HVC
2005
Springer
97views Hardware» more  HVC 2005»
14 years 2 months ago
An Extensible Open-Source Compiler Infrastructure for Testing
Testing forms a critical part of the development process for large-scale software, and there is growing need for automated tools that can read, represent, analyze, and transform th...
Daniel J. Quinlan, Shmuel Ur, Richard W. Vuduc
ICALP
2005
Springer
14 years 2 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...