On Optimal Update Policies and Cluster Sizes for 2-Tier Distributed Systems
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper, we consider the problem of monitoring soil moisture evolution using a wireless network of in situ sensors. Continuously sampling moisture levels with these sensors incurs high-maintenance and energy consumption costs, which are particularly ...
Many clustering methods are designed for especial cluster types or have good performance dealing with particular size and shape of clusters. The main problem in this connection is how to define a similarity (or dissimilarity) criterion to make an algorithm ...
One of the shortcomings of the existing clustering methods is their problems dealing with different shape and size clusters. On the other hand, most of these methods are designed for especial cluster types or have good performance dealing with particular s ...
This work addresses the problem of reducing the time between query submission and results output in a retrieval system. The goal is achieved by considering only a database fraction as small as possible during the retrieval process. Our approach is based on ...
The emergence of wireless sensor networks has imposed many challenges on network design such as severe energy constraints, limited bandwidth and computing capabilities. This kind of networks necessitates network protocol architectures that are robust, ener ...
We introduce a fast approach to classification and clustering applicable to high-dimensional continuous data, based on Bayesian mixture models for which explicit computations are available. This permits us to treat classification and clustering in a single ...
The emergence of wireless sensor networks has imposed many challenges on network design such as severe energy constraints, limited bandwidth and computing capabilities. This kind of networks necessitates network protocol architectures that are robust, ener ...
The purpose of this report is to present the study of a linguistic network based on the relation of synonymy. The network has been extracted from a dictionary of synonyms in French. Due to errors and ambiguities in the data, the synonyms are not always gro ...
In this paper we present an empirical study of a workload gathered by crawling the eDonkey network - a dominant peer-to-peer file sharing system - for over 50 days. We first confirm the presence of some known features, in particular the prevalence of free- ...
To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...
