Sciweavers

932 search results - page 157 / 187
» Where in the Wikipedia Is That Answer
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 8 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
14 years 7 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray