1204 search results - page 120 / 241 » Termination of Polynomial Programs |
144
Voted
ACCV
2009
Springer
15 years 7 months ago
2009
Springer
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
114
Voted
ASPDAC
1998
ACM
15 years 5 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
118
click to vote
FUIN
2000
15 years 17 days ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
187
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
180
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...