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 163 for “"Efficient Search"”.

  1. Effective and Efficient Search Across Languages

    … multiple languages has created a need to develop search systems to meet the diverse information needs of users. Cross-Language Information Retrieval (CLIR) plays an essential role in overcoming language barriers, allowing users to retrieve content in a language that differs from their query …

    maryland Repository record for Effective and Efficient Search Across Languages (opens in a new tab)

  2. Computationally efficient search for large primes

    … require continuous advancement. To find the most efficient algorithm, a need for a survey of methods arises. Concurrently, an urge for the analysis of algorithms' performances emanates. The critical criteria in the analysis of the prime numbers generation are the number of probes, number of …

    njit Repository record for Computationally efficient search for large primes (opens in a new tab)

  3. Target-distractor distinctiveness guides efficient search

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01

    uiuc Repository record for Target-distractor distinctiveness guides efficient search (opens in a new tab)

  4. An Efficient Search Paradigm Implementing a Unique Identifier

    … technologies are being developed every day. Searching forms an interesting branch of the Internet technology. There are many search techniques and search algorithms for the Internet and many more are being tried daily. In this thesis, a new paradigm of searching has been designed and tested. …

    sdstate Repository record for An Efficient Search Paradigm Implementing a Unique Identifier (opens in a new tab)

  5. Efficient search methods for high dimensional time-series

    This thesis looks at developing efficient methodology for analysing high dimensional time-series, with an aim of detecting structural changes in the properties of the time series that may affect only a subset of dimensions. Firstly, we develop a Bayesian approach to analysing multiple time-series …

    lancaster Download PDF for Efficient search methods for high dimensional time-series (opens in a new tab)

  6. Towards Algorithm Selection for Efficient Search-Based Software Engineering

    In Search-Based Software Engineering (SBSE), metaheuristic search algorithms are used to construct software by combining components that fulfill diverse user and business requirements. These search algorithms typically employ randomization to accurately and efficiently evaluate numerous component …

    rit Repository record for Towards Algorithm Selection for Efficient Search-Based Software Engineering (opens in a new tab)

  7. Towards a secure and efficient search over encrypted cloud data

    … utilization services such as plaintext keyword search. A simple solution of downloading the data, decrypting and searching locally is clearly inefficient since storing data in the cloud is meaningless unless it can be easily searched and utilized. Thus, cloud services should enable efficient …

    colostate Repository record for Towards a secure and efficient search over encrypted cloud data (opens in a new tab)

  8. Concurrency techniques for implementing efficient search trees in multicore systems

    Concurrent search trees are one of the most popular and widely used family of data structures. They are used in applications where it is necessary to store a large volume of sorted data with the ability to efficiently search, insert, remove, as well as more advanced operations, such as range …

    greece Repository record for Concurrency techniques for implementing efficient search trees in multicore systems (opens in a new tab)

  9. Generative and discriminative models for person verification and efficient search

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-04-10T20:41:56Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Li_Zhen.pdf: 10718613 bytes, checksum: 33d3a5f6a45d0870d945906fb9961656 (MD5)

    uiuc Repository record for Generative and discriminative models for person verification and efficient search (opens in a new tab)

  10. ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD

    … methods, since they must explore an exponential search space. In order to reduce this temporal explosion of SAT/ATPG based methods, efficient learning techniques are needed. Conventional ATPG aims at computing a single solution for its objective. In preimage computation, we must enumerate all …

    vt Repository record for ATPG based Preimage Computation: Efficient Search Space Pruning using ZBDD (opens in a new tab)

  11. Efficient search of general and-or keyword queries in XML data

    … approach to process general form AND-OR keyword search queries. To the best of our knowledge, this is the first work to handle keyword queries with any combination of AND and OR operators. We utilize the tree structure to represent the keyword search query. Using the query tree, not only the …

    nus Repository record for Efficient search of general and-or keyword queries in XML data (opens in a new tab) Download file for Efficient search of general and-or keyword queries in XML data (opens in a new tab)

  12. Characterization of Problematic Graphical Structures of LDPC Codes and the Corresponding Efficient Search Algorithms

    … introduction of the new techniques mitigates the search efficiency problem that LSS-based characterization/search suffers from.Moreover, we generalize the proposed approach of variable-regular to irregular LDPC codes. We explain how the characterization of LETS structures in variable-regular …

    carleton Repository record for Characterization of Problematic Graphical Structures of LDPC Codes and the Corresponding Efficient Search Algorithms (opens in a new tab)

  13. Efficient search and comparison algorithms for 3D protein binding site retrieval and structure alignment from large-scale databases

    … high-throughput and accurate protein structure search and comparison methods is essential. To meet the needs of the community, we develop several bioinformatics methods for protein binding site comparison and global structure alignment. First, we developed an efficient protein binding site …

    missouri Repository record for Efficient search and comparison algorithms for 3D protein binding site retrieval and structure alignment from large-scale databases (opens in a new tab)

  14. Algorithms for combinatorial optimization in real-time and their automated refinements by genetics-based learning

    The goal of this research is to develop a systematic, integrated method of designing efficient search algorithms that solve optimization problems in real time. Search algorithms studied in this thesis comprise meta-control and primitive search. The class of optimization problems addressed are …

    uiuc Repository record for Algorithms for combinatorial optimization in real-time and their automated refinements by genetics-based learning (opens in a new tab)

  15. Scene Search Guidance under Salience-driven and Memory-driven Demands

    Visual search involves selecting relevant information while ignoring irrelevant information. Most search models predict what relevant features attract gaze; yet few consider search guidance from previous knowledge of scenes. This dissertation used eye movements to examine the guidance of attention …

    south-carolina Repository record for Scene Search Guidance under Salience-driven and Memory-driven Demands (opens in a new tab)

  16. Double Blind Comparison: Secure Database Integration with Minimal Database Aggregation

    … one using bilinear pairings. It also develops an efficient search capability, illustrated using groups with infeasible inversion. This is the only pseudonymized database integration scheme with an efficient search capability.

    calgary Repository record for Double Blind Comparison: Secure Database Integration with Minimal Database Aggregation (opens in a new tab)

  17. Systematic variability in stage-one processing as revealed by eye movements in efficient visual search

    Most models of visual search have reported that efficient search tasks are characterized by “flat” search slopes of less than 10ms/item. Based on this, such models have concluded that stage-one processing times are invariant. In contrast, our lab recently reported systematic variability in …

    uiuc Repository record for Systematic variability in stage-one processing as revealed by eye movements in efficient visual search (opens in a new tab)

  18. MAX Human-centric searching of the physical world

    MAX is a vision of searching the physical world in seconds, as we are searching the Internet today. Built on the intuition that humans are powerful ``sensors'' that works well with landmark based information, we design the system to allow people to search for and locate objects as and when they …

    nus Repository record for MAX Human-centric searching of the physical world (opens in a new tab) Download file for MAX Human-centric searching of the physical world (opens in a new tab)

Page 1 of 9