501 search results - page 91 / 101 » Communication Lower Bounds Using Dual Polynomials |
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
ALENEX
2010
13 years 9 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
JSAC
2008
13 years 7 months ago
2008
We study revenue-maximizing pricing by a service provider in a communication network and compare revenues from simple pricing rules to the maximum revenues that are feasible. In pa...
TSP
2008
13 years 7 months ago
2008
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...