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 21 for “"Approximate search"”.
-
An approximate search engine for structure
… databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute-value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases …
-
Approximate search on massive spatiotemporal datasets.
Efficient time series similarity search is a fundamental operation for data exploration and analysis. While previous work has focused on indexing progressively larger datasets and has proposed data structures with efficient exact search algorithms, we motivate the need for approximate query methods …
-
Heuristic Global Optimization
… for solving GO problems. The goal of this research is to develop algorithms that can quickly find good quality solutions to large-scale nonconvex GO problems, which are the hardest form of GO problems. This research develops a fast heuristic multistart algorithm for solving large-scale GO …
-
Efficient Location-Aware Node And Object Discovery In Large-Scale Networks
… accurately. Second, I address the decentralized approximate search problem, where the objective is to efficiently scan an online database for the set of objects that are most similar to given search terms. I describe the Cubit system, which provides a fully decentralized and efficient approximate …
-
WAQS : a web-based approximate query system
… the amount of content available on it. However, searching for information on the Web has become increasingly difficult. Although query languages have long been part of database management systems, the standard query language being the Structural Query Language is not suitable for the Web content …
-
A Novel Indexing Method Using Hierarchical Classification for Face-Image Retrieval
… from a loss in accuracy introduced due to an approximate search. Therefore, this research study proposes a novel indexing method using a hierarchy of classifiers that predict attributes such as age, gender, and ethnicity on which the database is indexed through a hash table. Only a small …
-
New paradigms for approximate nearest-neighbor search
Nearest-neighbor search is a very natural and universal problem in computer science. Often times, the problem size necessitates approximation. In this thesis, I present new paradigms for nearest-neighbor search (along with new algorithms and theory in these paradigms) that make nearest-neighbor …
-
Algorithms for Order-Preserving Matching
… addition to the OPM problem, we also studied its approximate variation. In approximate order-preserving matching, we search for those substrings in the text which have relative order similar to the pattern, i.e., relative order of the pattern matches with at most k mismatches. With respect to …
-
Search and Join Algorithms for Tables in Data Lakes
… we describe two problems in managing data lakes: searching for tables that can be joined, and auto-generating syntactic transformations for joining tables with join values of different formats. Given a query table and a join column, the first problem is defined as searching for tables that can be …
-
Searching to Translate and Translating to Search: When Information Retrieval Meets Machine Translation
… and comprehension capabilities. As a result, search technologies have become a fundamental tool for accessing information. Furthermore, the web contains information in multiple languages, introducing another barrier between people and information. Therefore, search technologies need to handle …
-
Development of a context-specific search engine, an executive information system, and a novel www ready external cost model
… environmental/manufacturing world. Intelligent search engines have been built to access these huge databases in human readable format and correlate the data to various reports providing information on the environmentally hazardous chemicals, releases, and facilities in different regions. The …
-
Effect of Visualization of News Articles in Data Driven Games
… not possible manually. Moreover, keyword-based search is very limited when it comes to exploring data rather than just searching for something particular. The proposed work will develop a visualization and user interface to represent the news articles in an activity-appropriate manner and allow …
-
Structure prediction for human parsing
… standard tree model, despite the need to adopt approximate inference and learning procedures. The method uses an approximate search for inference, and an approximate structure learning method to learn. This thesis compares this method to state of the art methods on a dataset prepared at UIUC …
-
Management of biological sequences using suffix trees
… grows at phenomenal rate. Supporting various search tasks over such data efficiently requires development of sophisticated indexing techniques. Recently, suffix tree (ST) and suffix array (SA) received considerable attention as suitable data structures in this context. However, existing …
-
Efficient error-tolerant search on large text collections
… we consider the problem of fuzzy full-text search and query suggestion in large text collections, that is, full-text search that is robust against errors on the side of the query as well as errors on the side of the documents. We consider two variants of the problem. The first variant is …
-
Vision and Language Learning: From Image Captioning and Visual Question Answering towards Embodied Agents
… this problem, we propose constrained beam search, an approximate search algorithm that enforces constraints over RNN output sequences. Using this approach, we show that existing RNN captioning architectures can take advantage of side information such as object detector outputs and …
-
Active caching for recommender systems
… available while carrying out browsing and searching tasks. Recommender systems substantially reduce the information overload by suggesting a list of similar documents that users might find interesting. However, generating these ranked lists requires an enormous amount of resources that …
-
Pořízení podrobné a gigantické fotografie a lokalizace v ní
Cieľom tejto práce bolo vytvoriť veľký obrázok a novú techniku na lokalizáciu fotografie vo väčšom obrázku, aby sa zvýšila rýchlosť a presnosť bežných metód. Navrhovaná technika využíva architektúru CNN na extrakciu embeddings z dopytovaného obrázka, ktoré sa použijú na vyhľadávanie v databáze …
-
Spatial Reasoning through Artificial Intelligence
Searching for places using spatial information is useful in a variety of domains that are grounded in the physical world, including urban planning, civil engineering, travel, and many others. Use cases include region recommendation in urban planning, scene recognition in military and defense …
-
Algorithmic skeletons for exact combinatorial search at scale
Exact combinatorial search is essential to a wide range of application areas including constraint optimisation, graph matching, and computer algebra. Solutions to combinatorial problems are found by systematically exploring a search space, either to enumerate solutions, determine if a specific …
Page 1 of 2