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 69 for “"compact representations"”.

  1. Efficient and compact representations of head related transfer functions

    … an investigation into the use of alternative compact and efficient representations of an HRTF dataset measured in the azimuthal plane. The two main prongs of investigation are the use of orthogonal transformations in a decompositional approach, and parametric modelling approach that utilises …

    salford Download PDF for Efficient and compact representations of head related transfer functions (opens in a new tab)

  2. Robust Algorithms for Compact Representations in Large-Scale Data Processing

    <p>Compact representations are a central tool in large-scale data processing. They replace large datasets or complex problem instances with smaller, structure-preserving proxies. Their effectiveness, however, depends on the quality of the information underlying them. In practice, this information …

    duke Repository record for Robust Algorithms for Compact Representations in Large-Scale Data Processing (opens in a new tab)

  3. Solving norm equations over global function fields using compact representations

    … ideal testing via index calculus. We employed compact representations in both of the novel algorithms to represent solutions in less space and also to improve their efficiency. In order to compare the asymptotic and practical efficiency of the novel algorithms to the existing one, we performed …

    calgary Repository record for Solving norm equations over global function fields using compact representations (opens in a new tab)

  4. Improving regulator verification and compact representations in real quadratic fields

    … number field and refinements to the concept of a compact representation of a quadratic integer, originally given by Buchmann, Thiel, and Williams [12]. In addition, we consider the well-known applications of this theory to principal ideal testing, finding integer points on elliptic curves, finding …

    calgary Repository record for Improving regulator verification and compact representations in real quadratic fields (opens in a new tab)

  5. Learning Compact Representations for Efficient Whole Slide Image Search in Computational Pathology

    … and time complexities which leads to binary representations with an enhanced search performance compared to many recent hashing methods. We also proposed a novel quantization scheme, called non-rigid quantization (NRQ), where for the first time we proposed to employ non-rigid transformations …

    waterloo Repository record for Learning Compact Representations for Efficient Whole Slide Image Search in Computational Pathology (opens in a new tab)

  6. Autoencoder-based image dimensionality reduction methods

    … we study how images can be represented in a more compact way that still captures their most important features and preserves the similarities and dissimilarities between the images. These compact representations of images, also known as ‘image encodings’, allow us to identify similar images and …

    ghent Repository record for Autoencoder-based image dimensionality reduction methods (opens in a new tab)

  7. Tracking evolution of learning on a visualmotor task

    … the conceptual shifts, and for constructing compact representations of the subjects' stationary control policies. The policy models are "local" and use a novel extension to locally weighted regression. The closeness of fit of model performance to human learning curves experimentally …

    rice Repository record for Tracking evolution of learning on a visualmotor task (opens in a new tab)

  8. A QOBDD-based Approach to Simple Games

    … diagrams, or QOBDDs for short, are well-known as compact representations for subsets of powersets and Boolean functions. In this thesis, we use QOBDDs to represent simple games and to develop practically applicable algorithms to solve problems for simple games. We study properties of QOBDDs when …

    cau-kiel Repository record for A QOBDD-based Approach to Simple Games (opens in a new tab)

  9. BDD-based decision procedures for modal logic K

    … representation techniques which gives more compact representations. By taking advantage of the finite-tree-model property of K , we introduced a level-based evaluation scheme to speed up construction and reduce memory consumption. We also studied the effect of formula simplification on the …

    rice Repository record for BDD-based decision procedures for modal logic K (opens in a new tab)

  10. Computer Aided Design of Permutation, Linear, and Affine-Linear Reversible Circuits in the General and Linear Nearest-Neighbor Models

    … linear, and permutation circuits, have much more compact representations. The synthesis methods which operate on these restricted classes of reversible circuits are capable of synthesizing circuits with hundreds of inputs. In this thesis new types of synthesis methods are introduced for …

    portland-state Repository record for Computer Aided Design of Permutation, Linear, and Affine-Linear Reversible Circuits in the General and Linear Nearest-Neighbor Models (opens in a new tab)

  11. NAT-Modeled Dynamic Discretization for Inference with Sum of Continuous Variables

    Bayesian Networks (BNs) are compact representations of probabilistic knowledge for intelligent agents in partially observable and stochastic application environments. To specify a BN, conditional probability tables (CPTs) and the graphical dependency structure completely determine the joint …

    guelph Repository record for NAT-Modeled Dynamic Discretization for Inference with Sum of Continuous Variables (opens in a new tab)

  12. Understanding the Structure of 3D Shapes

    Compact representations of three dimensional objects are very often used in computer graphics to create effective ways to analyse, manipulate and transmit 3D models. Their ability to abstract from the concrete shapes and expose their structure is important in a number of applications, spanning from …

    cagliari Repository record for Understanding the Structure of 3D Shapes (opens in a new tab)

  13. Representation and Processing of Time Series Data with Hyperdimensional Computing

    … costs to model it explicitly. Therefore, compact representations that preserve temporal order while reducing complexity are essential. This thesis investigates Hyperdimensional Computing (HDC) as a framework for classifying time series. HDC encodes data into high-dimensional vector spaces …

    qucosa-diss

  14. Differentiable Subdivision Surface Fitting

    … surface fitting technique to derive a compact surface representation for a given dense point cloud or mesh, with application in the domains of graphics and CAD/CAM. We have chosen the Loop subdivision surface, which in the limit yields the smooth surface underlying the point cloud, and …

    concordia Download PDF for Differentiable Subdivision Surface Fitting (opens in a new tab)

  15. Efficient and dimension independent methods for neural network surrogate construction and training

    … map can be represented efficiently. These compact representations require relatively few data to train and outperform conventional data-driven approaches which require large training data sets. Once a neural network is designed, training is a major issue. One seeks to find optimal weights …

    texas Repository record for Efficient and dimension independent methods for neural network surrogate construction and training (opens in a new tab)

  16. A Probabilistic Analysis Of Low-Rank Approximations In Optimization Problems With Ellipsoidal Constraints

    … used in many applications, because they provide compact representations of the data and reveal the underlying structure. This dissertation is concerned with applications of low-rank approximations in optimization problems. Motivation comes from a recent effort in designing radiotherapy treatment …

    cornell Repository record for A Probabilistic Analysis Of Low-Rank Approximations In Optimization Problems With Ellipsoidal Constraints (opens in a new tab)

  17. Efficient texture representation and sampling algorithms for real-time rendering

    … and sampling algorithms. First, we present more compact representations for textures and frame buffers, reducing the consumed memory bandwidth and allowing more efficient use of the available memory space. Furthermore, we present and investigate a method that improves the surface detail under …

    greece Repository record for Efficient texture representation and sampling algorithms for real-time rendering (opens in a new tab)

  18. Data-driven Algorithms for Critical Detection Problems: From Healthcare to Cybersecurity Defenses

    … that efficiently processes voluminous logs with compact representations, overcoming real-time detection bottlenecks. These contributions provide deployable and effective solutions, offering insights for future research within and beyond the fields of healthcare and cybersecurity.

    vt Repository record for Data-driven Algorithms for Critical Detection Problems: From Healthcare to Cybersecurity Defenses (opens in a new tab)

  19. Three-dimensional shape characterization for particle aggregates using multiple projective representations

    … applications do not readily lend themselves to compact representations in three dimensions. The situation is even more challenging when one attempts to numerically describe the three-dimensional shapes of a mixture of objects such as in an aggregate mix. The goal of this study is the design, …

    rowan Repository record for Three-dimensional shape characterization for particle aggregates using multiple projective representations (opens in a new tab)

  20. On Dyadic Parity Check Codes and Their Generalizations

    … are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis.This dissertation focuses on codes based on parity check matrices that are dyadic, n-adic, or quasi-dyadic (QD), meaning the parity check matrix …

    nebraska Repository record for On Dyadic Parity Check Codes and Their Generalizations (opens in a new tab)

Page 1 of 4