Sciweavers

496 search results - page 74 / 100
» Machine models and lower bounds for query processing
Sort
View
COLT
1999
Springer
13 years 12 months ago
An Adaptive Version of the Boost by Majority Algorithm
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
Yoav Freund
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 1 days 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
PODC
2005
ACM
14 years 1 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
MST
2000
57views more  MST 2000»
13 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
VLDB
1997
ACM
104views Database» more  VLDB 1997»
13 years 12 months ago
A Generic Approach to Bulk Loading Multidimensional Index Structures
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
Jochen Van den Bercken, Bernhard Seeger, Peter Wid...