Sciweavers

    184 search results - page 2 / 37
    » Querying Proofs
    Sort
    View
    DBSEC
    2006
    160views Database» more  DBSEC 2006»
    On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
    13 years 6 months ago
    On Finding an Inference-Proof Complete Database for Controlled Query Evaluation
    Download  wiese.free.fr
    Abstract. Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling t...
    Joachim Biskup, Lena Wiese
    claim paper
    Read More »
    VLDB
    2007
    ACM
    161views Database» more  VLDB 2007»
    Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
    14 years 5 months ago
    Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams
    Download  www.cs.bu.edu
    As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
    Feifei Li, Ke Yi, Marios Hadjieleftheriou, George ...
    claim paper
    Read More »
    VLDB
    2005
    ACM
    151views Database» more  VLDB 2005»
    Query Execution Assurance for Outsourced Databases
    13 years 10 months ago
    Query Execution Assurance for Outsourced Databases
    Download  www.vldb2005.org
    In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a...
    Radu Sion
    claim paper
    Read More »
    FUIN
    2006
    145views more  FUIN 2006»
    Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
    13 years 5 months ago
    Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
    Download  www.mimuw.edu.pl
    We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
    Linh Anh Nguyen
    claim paper
    Read More »
    SIAMCOMP
    2008
    130views more  SIAMCOMP 2008»
    Short PCPs with Polylog Query Complexity
    13 years 5 months ago
    Short PCPs with Polylog Query Complexity
    Download  www.cs.technion.ac.il
    We give constructions of probabilistically checkable proofs (PCPs) of length n
    Eli Ben-Sasson, Madhu Sudan
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.