Sciweavers

6274 search results - page 140 / 1255
» From query complexity to computational complexity
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
EDBT
2006
ACM
143views Database» more  EDBT 2006»
16 years 4 months ago
XG: A Grid-Enabled Query Processing Engine
In [12] we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. In this demo we show how this architecture is le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Thom...
SC
2003
ACM
15 years 9 months ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu