Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
— Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome [9], [15] for such a game is an equilibrium concept that combine...
Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, ...
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...