Sciweavers

7167 search results - page 509 / 1434
» Answer Set Programming
Sort
View
EDBT
2006
ACM
156views Database» more  EDBT 2006»
16 years 4 months ago
Indexing Incomplete Databases
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...
ICDE
2010
IEEE
266views Database» more  ICDE 2010»
16 years 4 months ago
Provenance Browser: Displaying and Querying Scientific Workflow Provenance Graphs
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
Bertram Ludäscher, Manish Kumar Anand, Shawn ...
FOCS
2009
IEEE
15 years 11 months ago
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks
— 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, ...
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
15 years 11 months ago
Strong Parallel Repetition Theorem for Free Projection Games
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 ...
FCT
2009
Springer
15 years 11 months ago
Computing Role Assignments of Chordal Graphs
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 ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...