Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 258 for “"Communication cost"”.

  1. Personalized and Communication Cost Reduction Models in Federated Learning

    … resources, which causes hindrance to effective communication of the machine learning models. Researchers have used several techniques like quantization and asynchronous updates to reduce the communication costs, but these techniques cause an improvement of just 10-15%. Furthermore, most of the …

    regina Repository record for Personalized and Communication Cost Reduction Models in Federated Learning (opens in a new tab) Download PDF for Personalized and Communication Cost Reduction Models in Federated Learning (opens in a new tab)

  2. Caching techniques for reducing the communication cost of federated learning in IoT environments

    … methods. These methods are intended to lower the communication demands that come with regularly updating the model between the network's edge devices and the server. High communication costs can limit the use of FL, especially in situations involving many IoT devices with restricted bandwidth and …

    missouri Repository record for Caching techniques for reducing the communication cost of federated learning in IoT environments (opens in a new tab)

  3. Exploring the Tight Asymptotic Bounds of the Trade-off Between Query Anonymity & Communication Cost in Wireless Sensor Network

    … a natural trade-off between query-anonymity and communication-cost. We explore what we call the limits of this trade-off: what is the communication-cost that is sufficient to achieve a certain query-anonymity, and what is the communication-cost that we must necessarily incur to achieve a certain …

    waterloo Repository record for Exploring the Tight Asymptotic Bounds of the Trade-off Between Query Anonymity & Communication Cost in Wireless Sensor Network (opens in a new tab)

  4. Sandooq: improving the communication cost and service latency for a multi-user erasure-coded geo-distributed cloud environment

    … improve the reliability at a much lower storage cost. In addition to reliability, the clients and applications also demand storage solutions with better performance and cost-effectiveness. For a geo-distributed data center, a major part of the cost is associated with sending the data between the …

    uiuc Repository record for Sandooq: improving the communication cost and service latency for a multi-user erasure-coded geo-distributed cloud environment (opens in a new tab)

  5. Energy efficient compressed sensing in wireless sensor networks via random walk

    … of wireless sensor networks require we minimize communication cost for efficient power usage. At first, a compressive distributed sensing (CDS) algorithm is proposed but is then modified to decrease communication costs. The final algorithm presented is compressive distributed sensing with random …

    utc Repository record for Energy efficient compressed sensing in wireless sensor networks via random walk (opens in a new tab)

  6. Design and Analysis of Algorithms for Efficient Location and Service Management in Mobile Wireless Systems

    … system with the goal to minimize the network communication cost caused by service management operations. We show that for cellular wireless networks that provide packet services, when given a set of model parameters characterizing the network and workload conditions, there exists an optimal …

    vt Repository record for Design and Analysis of Algorithms for Efficient Location and Service Management in Mobile Wireless Systems (opens in a new tab)

  7. Quantum Compression and Quantum Learning via Information Theory

    … compression protocols, with potentially higher communication cost, have entanglement cost bounded by the number of qubits in the given states. This motivates the question as to whether entanglement is truly necessary for compression, and if so, how much of it is needed. We show that an ensemble …

    waterloo Repository record for Quantum Compression and Quantum Learning via Information Theory (opens in a new tab)

  8. Trading Privacy for Communication

    … privacy within the context of communication complexity. Unfortunately, it has been shown that most interesting functions are not privately computable [Kus89, BS08]. The unattainability of perfect privacy for many functions motivates the study of approximate privacy. This thesis …

    toronto-retro Repository record for Trading Privacy for Communication (opens in a new tab)

  9. Diagnosis of Finite State Models Under Partial or Unreliable Observations

    … explore tradeoffs among observation limitations, communication cost, and memory and processing requirements.

    uiuc Repository record for Diagnosis of Finite State Models Under Partial or Unreliable Observations (opens in a new tab)

  10. A Performance Analysis of Architectural Scalability

    … attainable. Algorithm penalty, interprocessor communication cost, and synchronization overhead are major factors limiting the performance scalability.

    uiuc Repository record for A Performance Analysis of Architectural Scalability (opens in a new tab)

  11. Towards an internet-scale stream processing service with loosely-coupled entities

    … queries to achieve load balance and minimize communication cost. The data layer service minimizes the communication cost of disseminating data streams from stream source nodes to entities. Our simulation studies show the efficiency of our proposed techniques.

    nus Repository record for Towards an internet-scale stream processing service with loosely-coupled entities (opens in a new tab) Download file for Towards an internet-scale stream processing service with loosely-coupled entities (opens in a new tab)

  12. Towards efficient and accountable oblivious cloud storage

    <p>Due to the convenience and unprecedented cost effectiveness, more and more individuals</p> <p>and organizations have utilized cloud storage servers to host their data. However, because</p> <p>of security and privacy concerns, not all data can be outsourced without reservation. The</p> …

    iastate Repository record for Towards efficient and accountable oblivious cloud storage (opens in a new tab)

  13. EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS

    … ECLDel graph is far simpler, which reduces the communication cost and saves the network bandwidth. We propose a Pre-Processed Cross Link Detection Protocol (PPCLDP), which generates a planar spanning subgraph of the original network graph in realistic environments with obstacles. The proposed …

    uky-thes Repository record for EFFICIENT GREEDY-FACE-GREEDY GEOGRAPHIC ROUTING PROTOCOLS IN MOBILE AD HOC AND SENSOR NETWORKS (opens in a new tab)

  14. Quantum Rejection Sampling

    … In this thesis, we consider the following communication task involving two parties Alice and Bob. Suppose that Alice is given a classical description of the states ρ and σ. Given an unlimited number of copies of an entangled state whose marginal on Bob’s side is σ, Alice’s goal is to help …

    waterloo Repository record for Quantum Rejection Sampling (opens in a new tab)

  15. Cost Analysis of Query-Anonymity on the Internet of Things

    … Moreover, we are interested in a communication-based approach in which the client is required to send k queries to at least k destinations including the node of interest in order to achieve a level-of-anonymity k. Thus, the communication-cost increases with the level-of-anonymity …

    waterloo Repository record for Cost Analysis of Query-Anonymity on the Internet of Things (opens in a new tab)

  16. Towards Privacy Preserving of Forensic DNA Databases

    … by matching probability, so as to reduce I/O cost required to find a particular profile. The second is an Elliptic Curve Cryptosystem based privacy-preserving matching engine, which performs match between candidates and user's sample. In particular, a privacy-preserving DNA profile matching …

    tamu Repository record for Towards Privacy Preserving of Forensic DNA Databases (opens in a new tab)

  17. ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ

    … OF FINDING AN OPTIMAL SCHEDULE, ASSUMING NO COMMUNICATION COST (UET CASE) OR ASSUMING UNIT COMMUNICATION COST (UET - UCT CASE) WAS SOLVED AND AN EFFICIENT ALGORITHM THAT PRODUCES THE OPTIMAL SCHEDULE WAS PROPOSED.

    greece Repository record for ΑΥΤΟΜΑΤΗ ΠΑΡΑΛΛΗΛΟΠΟΙΗΣΗ ΣΕΙΡΙΑΚΩΝ ΑΛΓΟΡΙΘΜΩΝ (opens in a new tab)

  18. DFA Minimization Algorithms in Map-Reduce

    … Moore (1956) and of Hopcroft (1971). The central cost-parameter in Map-Reduce is that of communication cost i.e., the amount of data that has to be communicated between the processes. Using techniques from Communication Complexity we derive an O(kn log{n}) lower bound and O(kn^3 log{n}) upper …

    concordia Download PDF for DFA Minimization Algorithms in Map-Reduce (opens in a new tab)

  19. On the Intersection of Communication and Machine Learning

    <p>The intersection of communication and machine learning is attracting increasing interest from both communities. On the one hand, the development of modern communication system brings large amount of data and high performance requirement, which challenges the classic analytical-derivation based …

    utk-theses Repository record for On the Intersection of Communication and Machine Learning (opens in a new tab)

  20. Anomaly Detection in Wireless Sensor Networks

    … consumed by real-time decision-making and the communication cost of information exchange. The numerical experiments demonstrate that the proposed schemes can achieve more robust performance with lower communication costs. 2) As existing techniques usually operate in a point-based manner that …

    unsw Repository record for Anomaly Detection in Wireless Sensor Networks (opens in a new tab)

Page 1 of 13