Sciweavers

3228 search results - page 517 / 646
» Computationally Sound Proofs
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Two Query PCP with Sub-Constant Error
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Dana Moshkovitz, Ran Raz
FOCS
2008
IEEE
14 years 3 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
SRDS
2008
IEEE
14 years 3 months ago
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
Eddy Caron, Ajoy Kumar Datta, Franck Petit, C&eacu...
AIMSA
2008
Springer
14 years 3 months ago
Tailoring the Interpretation of Spatial Utterances for Playing a Board Game
In order to build an intelligent system that allows human beings to cooperate with a computing machine to perform a given task it is important to account for the individual charact...
Andrea Corradini
ESCIENCE
2007
IEEE
14 years 3 months ago
GridR: An R-Based Grid-Enabled Tool for Data Analysis in ACGT Clinico-Genomics Trials
In this paper, we describe an analysis tool based on the statistical environment R, GridR, which allows using the collection of methodologies available as R packages in a grid env...
Dennis Wegener, Thierry Sengstag, Stelios Sfakiana...