Sciweavers

7988 search results - page 1028 / 1598
» A Useful Undecidable Theory
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
FOCS
1994
IEEE
15 years 11 months ago
The Load, Capacity and Availability of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
Moni Naor, Avishai Wool
212
Voted
ICDT
2010
ACM
195views Database» more  ICDT 2010»
15 years 11 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 11 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
« Prev « First page 1028 / 1598 Last » Next »