Sciweavers

630 search results - page 6 / 126
» Minimizing Communication Cost in Distributed Multi-query Pro...
Sort
View
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
DSN
2002
IEEE
14 years 20 days ago
Reducing the Cost of Group Communication with Semantic View Synchrony
View Synchrony (VS) is a powerful abstraction in the design and implementation of dependable distributed systems. By ensuring that processes deliver the same set of messages in ea...
José Orlando Pereira, Luís Rodrigues...
HIPC
2005
Springer
14 years 1 months ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das
TSP
2008
149views more  TSP 2008»
13 years 7 months ago
Decentralized Quantized Kalman Filtering With Scalable Communication Cost
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireles...
Eric J. Msechu, Stergios I. Roumeliotis, Alejandro...
P2P
2006
IEEE
229views Communications» more  P2P 2006»
14 years 1 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...