We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
A recently published approach to adaptive page rank, using the solution of quadratic optimization methods with a set of simple constraints [3], is modified to permit classificatio...
Franco Scarselli, Ah Chung Tsoi, Markus Hagenbuchn...
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...