451 search results - page 78 / 91 » Some Lower Bounds on Geometric Separability Problems |
102
click to vote
ALENEX
2009
14 years 10 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
TIT
2008
14 years 9 months ago
2008
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
ISTCS
1997
Springer
15 years 1 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
100
click to vote
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
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. ...