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 4 of 4 for “"point query"”.

  1. Towards realistic assumptions in searchable symmetric encryption

    … schemes leak structured information during query execution. Leakage-abuse attacks exploit this information, yet their reported effectiveness depends heavily on assumptions about the attacker’s auxiliary knowledge, the client’s query behaviour, and the types of queries being issued. We …

    ubc Repository record for Towards realistic assumptions in searchable symmetric encryption (opens in a new tab) Download PDF for Towards realistic assumptions in searchable symmetric encryption (opens in a new tab)

  2. Robust short clip representation and fast search through large video collections

    … (2) search efficiency in large datasets and (3) query flexibility are investigated. In order to effectively and robustly characterize the video segments of variable lengths, we design novel global visual signatures combining the spatial-temporal and the color range information together. Different …

    nus Repository record for Robust short clip representation and fast search through large video collections (opens in a new tab) Download file for Robust short clip representation and fast search through large video collections (opens in a new tab)

  3. Efficient Algorithms to Compute Hierarchical Summaries from Big Data Streams

    … a single item in O(1) time and responds to a point query in O(1) time. Importantly, the memory requirement of the proposed data structure is independent of the size of the data and only depends on user-supplied parameters ψ ⃗ and φ ⃗. In summary, this thesis provides a general framework …

    unsw Repository record for Efficient Algorithms to Compute Hierarchical Summaries from Big Data Streams (opens in a new tab)

  4. A Non-Intersecting R-Tree

    … range of applications. Such index trees support point and range queries but are costly to construct over datasets of millions of points. We present the Non-Intersecting R-Tree (NIR-Tree), a novel insert-efficient, in-memory, multidimensional index that uses bounding polygons to provide twice as …

    waterloo Repository record for A Non-Intersecting R-Tree (opens in a new tab)