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 28 for “"Incremental algorithms"”.

  1. Incremental algorithms for General Purpose Layout System

    General Purpose Layout System (GPLS) is proposed as a bidirectional layout conversion system. GPLS can translate layout to stick diagram, stick diagram to layout, layout to layout, mixed input to layout. To achieve these goals, the input format should accept both layout and stick diagram. The …

    uiuc Repository record for Incremental algorithms for General Purpose Layout System (opens in a new tab)

  2. Parallelization and incremental algorithms in the verse hybrid system verification library

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Parallelization and incremental algorithms in the verse hybrid system verification library (opens in a new tab)

  3. Incremental geometric robot motion planning

    In this thesis we introduce the notion of incremental problems in geometric robot motion planning, and give incremental algorithms to solve these problems efficiently. In particular, we present incremental algorithms to compute an exact cell decomposition of the collision-free portion of the robot …

    uiuc Repository record for Incremental geometric robot motion planning (opens in a new tab)

  4. An incremental gaussian mixture network for data stream classification in non-stationary environments

    … adaptive approaches are ensemble methods and incremental algorithms. Ensemble method plays an important role due to its modularity, which provides a natural way of adapting to change. Incremental algorithms are faster and have better anti-noise capacity than ensemble algorithms, but have more …

    brazil-ufrgs Repository record for An incremental gaussian mixture network for data stream classification in non-stationary environments (opens in a new tab)

  5. Continuous Reasoning of Large Complex Software via Incremental Analysis

    … bug. In this dissertation, we introduce several incremental algorithms which are efficient, precise, sound and scalable for real-world, large programs. Firstly, we present IPA, an incremental context-insensitive pointer analysis for Java programs that handles both statement addition, deletion and …

    tamu Repository record for Continuous Reasoning of Large Complex Software via Incremental Analysis (opens in a new tab)

  6. Continuous Reasoning of Large Complex Software via Incremental Analysis

    … bug. In this dissertation, we introduce several incremental algorithms which are efficient, precise, sound and scalable for real-world, large programs. Firstly, we present IPA, an incremental context-insensitive pointer analysis for Java programs that handles both statement addition, deletion and …

    tamu Repository record for Continuous Reasoning of Large Complex Software via Incremental Analysis (opens in a new tab)

  7. Continuous Reasoning of Large Complex Software via Incremental Analysis

    … bug. In this dissertation, we introduce several incremental algorithms which are efficient, precise, sound and scalable for real-world, large programs. Firstly, we present IPA, an incremental context-insensitive pointer analysis for Java programs that handles both statement addition, deletion and …

    tamu Repository record for Continuous Reasoning of Large Complex Software via Incremental Analysis (opens in a new tab)

  8. An Instantaneous Framework For Concurrency Bug Detection

    … a novel system design and two novel parallel incremental algorithms that embrace both change and parallelization for fundamental static analyses of concurrent programs. Both algorithms react to program changes by memoizing the analysis results and only recomputing the impact of a change in …

    tamu Repository record for An Instantaneous Framework For Concurrency Bug Detection (opens in a new tab)

  9. Exploiting Concept Clumping for Learning in Adaptive Personal Assistants

    … This dissertation introduces several novel incremental algorithms that address the above requirements and exploit the phenomenon of local coherences in the data, called concept clumping. The main application areas addressed in this thesis are: (i) incremental categorization of e-mail in the …

    unsw Repository record for Exploiting Concept Clumping for Learning in Adaptive Personal Assistants (opens in a new tab)

  10. Coping With New Challengens for Density-Based Clustering

    … which are addressed in this thesis. We develop incremental algorithms of OPTICS to efficiently reconstruct the hierarchical clustering structure in frequently updated databases, in particular, when a set of objects is inserted in or deleted from the database. We empirically show that these …

    lmu-germany Repository record for Coping With New Challengens for Density-Based Clustering (opens in a new tab)

  11. Context Models for Understanding Images and Videos

    … in such expressions. Context is also useful for incrementally understanding scenes and videos. In the second part of this thesis, we propose techniques for searching for objects in an image and events in a video. Our proposed incremental algorithms use the context from previously explored regions …

    maryland Repository record for Context Models for Understanding Images and Videos (opens in a new tab)

  12. Continual learning for geostationary satellite remote sensing of precipitation

    … from previous domains. In this work, new CL algorithms have been developed to improve model generalization across multiple precipitation retrieval tasks. Three different incremental algorithms are introduced to efficiently update the learned representation as new domains are incorporated, …

    colostate Repository record for Continual learning for geostationary satellite remote sensing of precipitation (opens in a new tab)

  13. AN EVALUATION OF THE SPARK PROGRAMMING MODEL FOR BIG DATA ANALYTICS

    … workloads, it is inefficient for iterative, incremental algorithms, ad hoc queries, and stream processing. Apache Spark is a general-purpose cluster-computing framework, which supports in-memory data analytics. It preserves the merits offered by Hadoop and overcomes its limitations. This …

    houston Repository record for AN EVALUATION OF THE SPARK PROGRAMMING MODEL FOR BIG DATA ANALYTICS (opens in a new tab)

  14. Online Machine Learning Algorithms Review and Comparison in Healthcare

    … have dependent and independent variables, ML algorithms perform mathematical calculations to find the best suitable mathematical equations to predict dependent variables using a given set of independent variables. These model performances depend on datasets and response, or dependent, variable …

    ut-knoxville Repository record for Online Machine Learning Algorithms Review and Comparison in Healthcare (opens in a new tab)

  15. Classification of high-dimensional mislabelled data and online algorithms for high-dimensional streaming data

    … Classification with mislabelled data and Online algorithms for streaming data. To overcome these challenges, we incorporate regularisation methods and utilise Sure Independence Screening (SIS) and Iteratively Sure Independence Screening (ISIS) (Fan and Lv, 2008, Fan and Song, 2010). In Chapter 3, …

    whiterose Download PDF for Classification of high-dimensional mislabelled data and online algorithms for high-dimensional streaming data (opens in a new tab)

  16. Accelerated Fuzzy Clustering

    Clustering algorithms are a primary tool in data analysis, facilitating the discovery of groups and structure in unlabeled data. They are used in a wide variety of industries and applications. Despite their ubiquity, clustering algorithms have a flaw: they take an unacceptable amount of time to run …

    usf Repository record for Accelerated Fuzzy Clustering (opens in a new tab)

  17. Advancements on problems involving maximum flows

    … In the second part of this defense, we explore incremental algorithms for solving an online sequence of Maximum Flow Problems (MFPs). Sequences of MFPs arise in a diverse collection of settings including computational biology, finger biometry, constraint programming and real-time scheduling. To …

    gatech Repository record for Advancements on problems involving maximum flows (opens in a new tab)

  18. Models and Algorithms for Persistent Queries over Streaming Graphs

    … into the system and new results are generated incrementally as the graph edges arrive, facilitate online analysis and real-time monitoring over streaming data. Processing persistent queries over streaming graphs combines two seemingly different but challenging problems: graph querying and …

    waterloo Repository record for Models and Algorithms for Persistent Queries over Streaming Graphs (opens in a new tab)

  19. Distributed algorithms for support vector machine training in wireless sensor networks

    … so-called support vectors. First, we present two incremental algorithms for distributed SVM training where the updates of the classifier are diffused sequentially in the network. We show that after a single complete pass through all the clusters, a good approximation of the optimal separating …

    greece Repository record for Distributed algorithms for support vector machine training in wireless sensor networks (opens in a new tab)

  20. The Incremental Constraint of k-Server

    Online algorithms are characterized by operating on an input sequence revealed over time versus a single static input. Instead of generating a single solution, they produce a sequence of incremental solutions corresponding to the input seen so far. An online algorithm's ignorance of future inputs …

    waterloo Repository record for The Incremental Constraint of k-Server (opens in a new tab)

Page 1 of 2