797 search results - page 63 / 160 » Eliminating Proofs from Programs |
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
112
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
94
Voted
POPL
1997
ACM
15 years 4 months ago
1997
ACM
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
155
Voted
AGP
2010
IEEE
14 years 10 months ago
2010
IEEE
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
123
click to vote
TLDI
2010
ACM
15 years 9 months ago
2010
ACM
We propose a programming language, called PCML5, for building distributed applications with distributed access control. Target applications include web-based systems in which prog...