2084 search results - page 255 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
160
click to vote
ICDE
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper, we consider a distributed video server environment where video movies need not be stored entirely in one server. Blocks of a video movie are allowed to be distribut...
107
click to vote
AAAI
2012
13 years 11 days ago
2012
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
GCB
2006
Springer
15 years 1 months ago
2006
Springer
: In this paper we describe a similarity model that provides the objective basis for clustering proteins of similar structure. More specifically, we consider the following variant ...
IPSN
2004
Springer
15 years 3 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...