49 search results - page 5 / 10 » A Structural Proof of the Soundness of Rely guarantee Rules |
166
click to vote
ICCV
2007
IEEE
16 years 11 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
164
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
168
click to vote
DIALM
2004
ACM
15 years 11 months ago
2004
ACM
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
160
click to vote
LATA
2009
Springer
16 years 25 days ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
179
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...