804 search results - page 110 / 161 » On the Termination of the Chase Algorithm |
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
109
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
142
click to vote
AAAI
2008
15 years 1 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
87
Voted
ECCV
2004
Springer
16 years 2 months ago
2004
Springer
We propose a method for measuring the quality of a grouping result, based on the following observation: a better grouping result provides more information about the true, unknown g...
104
Voted
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
Low-complexity video encoding has been applicable to several emerging applications. Recently, distributed video coding (DVC) has been proposed to reduce encoding complexity to the...