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 17 of 17 for “"incremental update"”.

  1. A peer distributed web caching system with incremental update scheme

    … a peer-distributed web caching system with incremental update and delivery scheme. In the system, clients share their local caches with peers in a distributed manner. This utilizes the perishable computation power and the cache storage on nearby peer clients to achieve large cache storage …

    nus Repository record for A peer distributed web caching system with incremental update scheme (opens in a new tab) Download file for A peer distributed web caching system with incremental update scheme (opens in a new tab)

  2. Efficient Rendering of Scenes with Dynamic Lighting Using a Photons Queue and Incremental Update Algorithm

    … the kd-tree leaf nodes data and implemented new incremental update scheme to improve the performance for dynamic lighting. The implementation is GPU-based and fully parallelized. A series of benchmarks with the prevalent existing GPU photon mapping technique is carried out to evaluate our …

    concordia Download PDF for Efficient Rendering of Scenes with Dynamic Lighting Using a Photons Queue and Incremental Update Algorithm (opens in a new tab)

  3. Incremental Analysis of Programs

    … an inefficient system. In this theses a set of incremental update algorithms are presented for data flow analysis. These algorithms update the solution from a previous analysis to reflect changes in the program. Thus, extensive reanalysis to reflect changes in the program. Thus, extensive …

    ucf Repository record for Incremental Analysis of Programs (opens in a new tab)

  4. Towards Efficient Packet Classification Algorithms and Architectures

    … two novel algorithms, Packet Classification with Incremental Update (PCIU) and Group Based Search packet classification Algorithm (GBSA), that are scalable and demonstrate excellent results in terms of preprocessing and classification. The PCIU algorithm is an innovative and efficient packet …

    guelph Repository record for Towards Efficient Packet Classification Algorithms and Architectures (opens in a new tab)

  5. HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD

    … at the edge. InkStream introduces an event-based incremental update mechanism for dynamic graph neural network inference, significantly reducing redundant computation for real-time performance in the cloud. Hopii presents a unified hop-centric programming model and accelerator architecture for …

    nus Repository record for HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD (opens in a new tab) Download file for HARDWARE-SOFTWARE CO-DESIGN FOR ACCELERATING GRAPH PROCESSING AND GNNS: FROM EDGE TO CLOUD (opens in a new tab)

  6. Interactive functional programming

    … of the overall vision, including efficient incremental update and scaling to large programs, for future work. Our specific achievements are as follows. First, we show how to reify the execution of a program into a live document which can be interactively decomposed into both sequential steps …

    birmingham Download PDF for Interactive functional programming (opens in a new tab)

  7. ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM

    … and implementation of a software system for the Incremental Rectangle Packing Problem. The general bin-packing problem is the problem of packing a collection of objects (of any dimension) into well-defined regions (called bins) such that they do not overlap, The overall aim is to maximise the …

    nus Repository record for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab) Download file for ALGORITHMS FOR AN INCREMENTAL BIN-PACKING SYSTEM (opens in a new tab)

  8. AN INCREMENTAL MULTISCALE NON–LINEAR MANIFOLD APPROXIMATION METHOD

    … Our focus is on the development of an incremental non-linear dimension reduction method for streaming data based on the Geometric Multi-Resolution Analysis framework. The primary goal is to assess the incremental GMRA's effectiveness compared to the batch GMRA approach and overcome key …

    mtu Repository record for AN INCREMENTAL MULTISCALE NON–LINEAR MANIFOLD APPROXIMATION METHOD (opens in a new tab)

  9. Optimising datalog materialisations

    … management for both the initial computation and incremental maintenance of materialisations. Most existing approaches default to general-purpose update strategies without considering optimisations for specific rule structures. From a computational perspective, standard materialisation techniques …

    oxford Repository record for Optimising datalog materialisations (opens in a new tab)

  10. Robust incremental relational learning

    … stream. This thesis investigates the problem of incremental, relational learning from imperfect data with constrained time and memory resources. The learning process involves incremental update of a theory when an example is presented that contradicts the theory. Contradictions occur if there is …

    unsw Repository record for Robust incremental relational learning (opens in a new tab)

  11. Efficient Node-to-Node Relevance Assessment Based on Hyperlinks

    … computational efficiency on large networks, (2) incremental update on dynamic networks, and (3) semantics improvement of existing similarity measures. More specifically, our contributions are summarized as follows: (1) We propose efficient techniques for assessing SimRank relevance on large …

    unsw Repository record for Efficient Node-to-Node Relevance Assessment Based on Hyperlinks (opens in a new tab)

  12. Practical Asymmetric Two-Server Private Information Retrieval: One-Server Queries and Separated Hint Provision

    … for evolving data, AsymPirex further introduces incremental update mechanisms that let clients patch their local hints in place, with O(1) work for each hint that covers a modified record, supporting dynamic databases without re-running the costly preprocessing phase. We establish index privacy …

    queens Repository record for Practical Asymmetric Two-Server Private Information Retrieval: One-Server Queries and Separated Hint Provision (opens in a new tab)

  13. A Framework for Scalable Dataset Generation and Deep Learning-Based IoT Device Identification: Redefining the Future Paradigm

    … realistic and balanced dataset, and enabling incremental learning to support newly added devices without full model retraining. A detailed examination of widely adopted public datasets reveals key limitations, notably complex network traffic capture setups, inconsistent annotation practices, …

    concordia Download PDF for A Framework for Scalable Dataset Generation and Deep Learning-Based IoT Device Identification: Redefining the Future Paradigm (opens in a new tab)

  14. Answering Shortest Path Distance Queries in Large Complex Networks

    … on dynamic graphs and they can hardly update a distance labelling efficiently. In this thesis, we propose a fully dynamic method which can efficiently reflect graph changes (i.e., single edge insertions or deletions) by dynamically maintaining a distance labelling in order to answer …

    anu Repository record for Answering Shortest Path Distance Queries in Large Complex Networks (opens in a new tab)

  15. ALGORITHMS AND DATA STRUCTURES FOR INDEXING, QUERYING, AND ANALYZING LARGE COLLECTIONS OF SEQUENCING DATA IN THE PRESENCE OR ABSENCE OF A REFERENCE

    … We describe, further, how this index can be made incrementally updatable by developing an efficient merge algorithm and storing the overall index in a multi-level log-structured merge (LSM) tree. We demonstrate the utility of this index by building a searchable Mantis, via recursive merging, over …

    maryland Repository record for ALGORITHMS AND DATA STRUCTURES FOR INDEXING, QUERYING, AND ANALYZING LARGE COLLECTIONS OF SEQUENCING DATA IN THE PRESENCE OR ABSENCE OF A REFERENCE (opens in a new tab)

  16. Efficient Techniques For Relevance Feedback Processing In Content-based Image Retrieval

    … property. The third contribution is an incremental query processing technique for Support Vector Machines (SVMs). SVMs have been widely used in multimedia retrieval to learn a concept in order to find the best matches. SVMs, however, suffer from the scalability problem associated with …

    ucf Repository record for Efficient Techniques For Relevance Feedback Processing In Content-based Image Retrieval (opens in a new tab)

  17. Parallel Inverted Indices for Large-Scale, Dynamic Digital Libraries

    … conditions. Further, the issues of creation and incremental updates of the index are considered. A disk-based inversion algorithm and an extensible inverted index architecture are described, and experimental results with actual collections are presented. Finally, distributed algorithms to create …

    vt Repository record for Parallel Inverted Indices for Large-Scale, Dynamic Digital Libraries (opens in a new tab)