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 35 for “"Graph-based Algorithms"”.

  1. Graph-based Algorithms for Lexical Semantics and its Applications

    … of words, which is a useful tool for computer-based automatic natural language processing (NLP). This thesis explores graph-based algorithms to learn and apply distributional lexical semantics in NLP applications. One theory of lexical semanticists holds that semantic relations among words can …

    washington Repository record for Graph-based Algorithms for Lexical Semantics and its Applications (opens in a new tab)

  2. Graph-based algorithms and models for security, healthcare, and finance

    Graphs (or networks) are now omnipresent, infusing into many aspects of society. This dissertation contributes unified graph-based algorithms and models to help solve large-scale societal problems affecting millions of individuals' daily lives, from cyber-attacks involving malware to tobacco and …

    gatech Repository record for Graph-based algorithms and models for security, healthcare, and finance (opens in a new tab)

  3. Graph based algorithms to efficiently map VLSI circuits with simple cells

    This thesis introduces a set of graph-based algorithms for efficiently mapping VLSI circuits using simple cells. The proposed algorithms are concerned to, first, effectively minimize the number of logic elements implementing the synthesized circuit. Then, we focus a significant effort on minimizing …

    brazil-ufrgs Repository record for Graph based algorithms to efficiently map VLSI circuits with simple cells (opens in a new tab)

  4. Evaluation Techniques and Graph-Based Algorithms for Automatic Summarization and Keyphrase Extraction

    … a relativized scale for evaluating different algorithms. This is our major contribution which challenges the traditional approach of working with an absolute scale. We consider the impact of some of the environment variables (length of the document, references, and system-generated outputs) on …

    unt Repository record for Evaluation Techniques and Graph-Based Algorithms for Automatic Summarization and Keyphrase Extraction (opens in a new tab)

  5. Graph-based algorithms for transistor count minimization in VLSI circuit EDA tools

    This master’s thesis introduces a set of graph-based algorithms for obtaining reduced transistor count VLSI circuits using simple cells. These algorithms are mainly focused on minimizing node count in AIG representations and mapping this optimized AIG using simple cells (NAND2 and NOR2) with a …

    brazil-ufrgs Repository record for Graph-based algorithms for transistor count minimization in VLSI circuit EDA tools (opens in a new tab)

  6. Retrieval-Augmented Neural Team Formation

    … set of skills. Existing solutions often use graph-based algorithms to locate subgraphs that satisfy skill requirements or employ neural methods to match specific capabilities to individual experts. In this work, a retrieval-augmented generation (RAG) approach is introduced, providing both …

    guelph Repository record for Retrieval-Augmented Neural Team Formation (opens in a new tab)

  7. Graph-Based Autonomous Vehicle Motion Planning Using Game Theory

    … these benefits, advanced planning and control algorithms are crucial. Given the interactions between Autonomous Vehicles (AVs) and human-driven vehicles in mixed traffic, as well as with pedestrians and cyclists, the deci- sions and trajectories of AVs significantly impact other road users. …

    waterloo Repository record for Graph-Based Autonomous Vehicle Motion Planning Using Game Theory (opens in a new tab)

  8. Fast algorithms for total variation minimization with applications to image deconvolution and compressed sensing

    This thesis presents two fast algorithms for total variation based image restoration. As an important branch of imaging sciences, image restoration aims to recover the original images from the degraded observations or measurements and usually some kind of regularization techniques are required for …

    rice Repository record for Fast algorithms for total variation minimization with applications to image deconvolution and compressed sensing (opens in a new tab)

  9. Design and implementation of distributed Galois

    … to the hard problem of parallelizing irregular algorithms using amorphous data-parallelism. The present system works on the shared-memory programming model. The programming model has limitations on the memory and processing power available to the application. A scalable distributed …

    texas Repository record for Design and implementation of distributed Galois (opens in a new tab)

  10. Resource management in location aware cognitive radio networks

    … of binary assignment variables, we propose novel graph based algorithms to optimally solve these problems. Further, we analyze the impact of location awareness on network performance of CRNs by considering three cases: Full location Aware, Partial location Aware and Non location Aware. Our results …

    mtu Repository record for Resource management in location aware cognitive radio networks (opens in a new tab)

  11. Only Pick Once-Multi-Object Picking Algorithms for Picking Exact Number of Objects Efficiently

    … Only-Pick-Once System (OPOS) contains several graph-based algorithms that convert the layout of objects into a graph, cluster nodes in the graph, rank and select candidate clusters based on their topology. OPOS also has a multi-object picking predictor based on a convolutional neural network …

    usf Repository record for Only Pick Once-Multi-Object Picking Algorithms for Picking Exact Number of Objects Efficiently (opens in a new tab)

  12. A Novel Assembly Algorithm That Optimizes For RNA-Seq Data

    … is to assemble all short reads. The de Bruijn graph-based algorithms, such as Oases, are usually used for short reads assembly to resolve the issue of computational complexity. However, de Bruijn graph-based assemblers normally generate high error rates when assembling RNA-Seq data. We have …

    nodak Repository record for A Novel Assembly Algorithm That Optimizes For RNA-Seq Data (opens in a new tab)

  13. Graph-based Pattern Matching and Discovery for Process-centric Service Architecture Design and Integration

    … The increasing adoption of service-based architectures to solve integration problems and the widely accepted practice of utilising patterns as a medium to reuse design knowledge motivated the definition of this work. In this work a pattern-based framework and techniques providing …

    dcu Download PDF for Graph-based Pattern Matching and Discovery for Process-centric Service Architecture Design and Integration (opens in a new tab)

  14. A Graph-Theoretic Approach to Model Genomic Data and Identify Biological Modules Asscociated with Cancer Outcomes

    … This dissertation examines the capacity of graph-theoretical methods to model and analyze genomic information and thus facilitate using prior knowledge to create a more discrete and functionally relevant feature space. To assess the statistical and computational value of graph-based …

    washington Repository record for A Graph-Theoretic Approach to Model Genomic Data and Identify Biological Modules Asscociated with Cancer Outcomes (opens in a new tab)

  15. Enhancing fairness and player satisfaction in electronic games: an analysis of matchmaking algorithms and player feedback in MOBA games

    … such as Elo and TrueSkill 2, and innovative graph-based algorithms, CentroMatch aims to create a more accurate and balanced matchmaking process. A comprehensive literature review was conducted to examine existing skill rating systems mentioned previously and emphasize the importance of player …

    laurentian Repository record for Enhancing fairness and player satisfaction in electronic games: an analysis of matchmaking algorithms and player feedback in MOBA games (opens in a new tab)

  16. Explainable Methods for Information Extraction

    … domain, traditional methods, such as rule-based methods, have offered high degrees of interpretability; one could simply look at the rule to understand, to a reasonable degree, how (and why) a specific decision is being made. Yet, these methods are limited in their expressivity, leading to …

    arizona-thes Repository record for Explainable Methods for Information Extraction (opens in a new tab)

  17. Graph Data Processing: Accelerating Set intersection

    … such as common neighbor computation in graph-based algorithms, set similarity computation, item recommendation, etc. In the literature, many set intersection methods are proposed. We observe that the state-of-the-art algorithm RCode bears several limitations, such as high index time …

    unsw Repository record for Graph Data Processing: Accelerating Set intersection (opens in a new tab)

  18. SCALABLE BUS ENCODING FOR ERROR-RESILIENT HIGH-SPEED ON-CHIP COMMUNICATION

    … methods. The proposed technique utilizes graph-based algorithms to produce a set of valid code words. The algorithm takes advantage of implicit set operations using binary decision diagram to improve the scalability of the code word selection process. The code words of many crosstalk …

    siu-theses Repository record for SCALABLE BUS ENCODING FOR ERROR-RESILIENT HIGH-SPEED ON-CHIP COMMUNICATION (opens in a new tab)

  19. Dynamic schema evolution in a heterogeneous database environment: A graph theoretic approach

    … methodology for managing schema evolution using graph theory with a well-defined set of operators and graph-based algorithms for tracking and propagating schema changes. We show that these operators and algorithms preserve the consistency and correctness of the schema following the changes. The …

    arizona-thes Repository record for Dynamic schema evolution in a heterogeneous database environment: A graph theoretic approach (opens in a new tab)

Page 1 of 2