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 11 of 11 for “"Greedy Selection"”.
-
Performance analysis of greedy subchannel allocation schemes for adaptive OFDMA systems
… performance restriction. The ordered subchannel selection with adaptive modulation scheme is applied to both cases. In single-hop case, a low-complexity greedy subchannel allocation algorithm with two options is proposed, depending on whether a common modulation mode is applied on all selected …
-
Sparse image representation with encryption
… by classic, Matching Pursuit (MP) based, greedy selection strategies. One such technique, termed Orthogonal Matching Pursuit (OMP), is shown to be suitable for producing sparse approximations of images, if they are processed in small blocks. When the blocks are enlarged, the proposed Self …
-
Image reconstruction through multiple 1D approximations
… a series of 1D interpolations and also uses greedy sampling. By generating uniformly distributed projections and projecting pixel coordinates onto these projections, we form 1D curves and use interpolation to predict the values of the original function. Linear interpolation is employed for …
-
Modeling data by multiple subspaces: theory and algorithms.
… further processed in various ways. For example, greedy selection procedure according to an appropriate energy or a spectral method to generate the final model. We demonstrate the state of the art accuracy and speed of the suggested procedure on applications for several applications.
-
Autonomous Drug Design with Reinforcement Learning
… and our aim was to achieve this by improving the selection of compounds. To do this, we developed two deep reinforcement learning algorithms, Deep-Q Network (DQN) and Double Deep-Q Network (DDQN), and compared these to two baseline selection algorithms. This approach was chosen as it translates …
-
High quality functional coverage based trace signal selection for post-silicon validation
… remaining signal values. Existing methods use a greedy selection process to converge to a locally optimal selection; this kind of method suffers from severe diminishing restoration ratio effect as more trace signals are selected. In addition, all of the previous publications have been focused on …
-
Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives
… the write amplification factor for the greedy selection algorithm, known to approximate real world algorithms well, under skewed write traffic. The prediction errors against simulations are shown to be within 4%. Furthermore, we demonstrate, as a surprising corollary, that the write …
-
Leveraging Machine Learning and Causal Inference for Loan Default Prediction
… validation, the modeling pipelines (feature selection + prediction) were evaluated for accuracy, precision, recall, and F1-score to determine their effectiveness in predicting loan defaults. Among the models tested, Naive Bayes overall demonstrated the best performance (F1-score), …
-
Image annotation and retrieval based on multi-modal feature clustering and similarity propagation.
… semi-supervised possibilistic clustering; (ii) a greedy selection and joining algorithm (GSJ); (iii) Bayes rule; and (iv) a probabilistic model that is based on possibilistic memebership degrees to annotate an image. The third component of the proposed system consists of an image retrieval …
-
Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search
… 𝐻-infinity approximations, we develop a greedy algorithm for efficiently modeling large-scale parametric dynamical systems in an 𝐻₂-sense. We demonstrate the effectiveness of this greedy search on a fluid problem, a mechanics problem, and a thermal problem. We also investigate Bayesian …
-
Scalable Multi-Agent Systems in Restricted Environments
… relation from combinatorics which utilizes the greedy selection algorithm and a matroid condition to create an efficient planner that maintains a fixed performance ratio when compared to the optimal path. We then introduce a motivating example of autonomously assisted search and rescues using …