Sciweavers

1007 search results - page 41 / 202
» The Complexity of Futile Questioning
Sort
View
AIIA
2007
Springer
14 years 3 months ago
English Querying over Ontologies: E-QuOnto
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
Raffaella Bernardi, Francesca Bonin, Diego Calvane...
APLAS
2010
ACM
13 years 8 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
IACR
2011
127views more  IACR 2011»
12 years 9 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 8 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
SAC
2008
ACM
13 years 8 months ago
Data sharing vs. message passing: synergy or incompatibility?: an implementation-driven case study
One reasonable categorization of coordination models is into data sharing or message passing, based on whether the information necessary to coordination is persistently stored and...
Matteo Ceriotti, Amy L. Murphy, Gian Pietro Picco