Sciweavers

882 search results - page 36 / 177
» On self-embeddings of computable linear orderings
Sort
View
LICS
2009
IEEE
15 years 4 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons
LICS
2008
IEEE
15 years 4 months ago
Hiding Local State in Direct Style: A Higher-Order Anti-Frame Rule
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
François Pottier
CVPR
2010
IEEE
15 years 6 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
TIT
2008
103views more  TIT 2008»
14 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
GRID
2006
Springer
14 years 9 months ago
Workflow Global Computing with YML
In this paper we propose a framework dedicated to the development and the execution of parallel applications over large scale global computing platforms. A workflow programming env...
Olivier Delannoy, Nahid Emad, Serge G. Petiton