Sciweavers

244 search results - page 30 / 49
» Towards a Theory of Extractable Functions
Sort
View
ESOP
2010
Springer
14 years 5 months ago
Formal Verification of Coalescing Graph-Coloring Register Allocation
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
Andrew W. Appel, Benoît Robillard, Sandrine ...
LICS
2008
IEEE
14 years 2 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
ICIP
2007
IEEE
14 years 2 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
ARGMAS
2008
Springer
13 years 9 months ago
A Dialogue Mechanism for Public Argumentation Using Conversation Policies
In this paper, we propose a flexible dialogue mechanism through which a set of agents can establish a coherent set of public beliefs. Flexibility and coherence are achieved by dec...
Yuqing Tang, Simon Parsons
ACISICIS
2005
IEEE
13 years 9 months ago
Equivalence of Transforming Non-Linear DACG to Linear Concept Tree
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
Wenyi Bi, Junping Sun