Sciweavers

90 search results - page 13 / 18
» Argumentation Databases
Sort
View
WWW
2010
ACM
14 years 4 months ago
Highlighting disputed claims on the web
We describe Dispute Finder, a browser extension that alerts a user when information they read online is disputed by a source that they might trust. Dispute Finder examines the tex...
Rob Ennals, Beth Trushkowsky, John Mark Agosta
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 3 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
AVI
1996
13 years 11 months ago
A visual interface for synchronous collaboration and negotiated transactions
: This paper introduces a visual interface for computer-supported cooperative work (CSCW). The interface is an extension of the editor interface of ESCHER, a prototype database sys...
Lutz Michael Wegner, Manfred Paul 0002, Jens Thamm...
FOCS
2010
IEEE
13 years 7 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan