Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Abstract— In this paper, we present a framework for multiterminal video compression (MTVC) that exploits the geometric constraints between cameras with overlapping fields of vie...
— Traditional Physical Carrier Sensing (PCS), which aims at eliminating hidden terminals in wireless networks, causes too many exposed terminals and deteriorates the throughput p...
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...