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 2683 for “"rank"”.
-
Low rank matrix completion
We consider the problem of recovering a low rank matrix given a sampling of its entries. Such problems are of considerable interest in a diverse set of fields including control, system identification, statistics and signal processing. Although the general low rank matrix completion problem is …
-
The maximal rank conjecture
… degree d. In this thesis, we prove the Maximal Rank Conjecture, which determines the Hilbert function of C Pr.
-
Rank Based Anomaly Detection Algorithms
… algorithms that exploit the notion of ``rank," expressing relative outlierness of different points in the relevant space, and exploiting asymmetry in nearest neighbor relations between points: a data point is ``more anomalous" if it is not the nearest neighbor of its nearest neighbors. …
-
The rank analysis of triple comparisons
… methods of analysis of data obtained from the ranks of items compared in groups of size three.
-
Low rank methods for optimizing clustering
… often have the majority of information in a low rank subspace. By careful exploitation of these low rank structures in clustering problems, we find new optimization approaches that reduce the memory and computational cost.</p> <p>We discuss two cases where this arises. First, we consider the …
-
Distributed content collection and rank aggregation
… system with joint content collection and rank aggregation. In such a system, peers contact each other and exchange partial preference information about items, which, for example, could be videos. Peers use recommendation strategies to make decisions with limited knowledge and collect items …
-
Relative waring rank of binary forms
This Dissertation was approved for publication on 2017-07-05 at 08:54.
-
Harish-Chandra Bimodules in Complex Rank
… Etingof’s paper Representation Theory in Complex Rank II. We also construct a family of Harish-Chandra bimodules that interpolate simple finite dimensional bimodules in the classical case. It turns out that they have finite K-type, which is a non-vacuous condition for the Harish-Chandra bimodules …
-
Schur Weyl duality in complex rank
This thesis gives an analogue to the classical Schur-Weyl duality in the setting of Deligne categories. Given a finite-dimensional unital vector space V (i.e. a vector space V with a distinguished non-zero vector 1) we give a definition of a complex tensor power of V. This is an Ind-object of the …
-
Co-rank 1 Arithmetic Siegel--Weil
We prove the arithmetic Siegel–Weil formula in co-rank 1, for Kudla–Rapoport special cycles on exotic smooth integral models of unitary Shimura varieties of arbitrarily large even arithmetic dimension. We also propose a construction for arithmetic special cycle classes associated to possibly …
-
The Relationship Between the Minimal Rank of a Tree and the Rank-Spreads of the Vertices and Edges
… to the edges of G. Let mr(F,G)be the minimum rank over all matrices in S(F,G). We give a field independent proof of a well-known result that for a tree the sum of its path cover number and minimal rank is equal to the number of vertices in the tree. The rank-spread of a vertex v of G is the …
-
How to Rank Answers in Text Mining
… CEW-DTW and assess its performance about ranking quality. Based on the CEW-DTW, we improve this methodology by combining Kullback-Leibler divergence with CEW-DTW, since Kullback-Leibler divergence can check the difference of probability distributions in two sequences. However, CEW-DTW and …
-
The Minimum Rank Problem Over Finite Fields
… forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs and show that many of these are minimal forbidden subgraphs for any field. Our second main result is a structural characterization of all graphs …
-
Rank 3 permuation characters and maximal subgroups
… in G of a point in E. We say G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1 \(\frac{G}{H}\) the permutation character or permutation module over the complex number field of G on the cosets G/H. Let H and K be …
-
Hydroxyl functionalities of middle rank british coals
… was attempted to characterise coals of various rank (and subsequently their macerals) via methods involving both microwave-driven and bench top derivatisation of the hydroxyl functionalities present in coal. These hydroxyl groups are predominantly in the form of hindered phenolic groups, with …
-
Rank-Based Procedures for Some Multivariate Problems
The remainder of my thesis studies multivariate symmetry. Several well-studied parametric and nonparametric tests for univariate symmetry are extended to multivariate settings. We study the asymptotic distributions of these multivariate tests, and we propose a new criterion to compare their …
-
Rank constrained denoising in magnetic resonance imaging
… This thesis investigates the utility of low-rank property in the denoising problem for the following two MRI modalities: diffusion magnetic resonance imaging and magnetic resonance spectroscopic imaging (MRSI). For denoising magnitude diffusion weighted image series, we utilize both low-rank …
-
Dynamic speech imaging with low-rank approximation
Dynamic speech imaging is a powerful technique for real-time visualization of speech dynamics. As a promising modality for dynamic speech imaging, magnetic resonance imaging (MRI) can provide good soft-tissue contrast in an arbitrary imaging plane with a non-invasive procedure. However, …
-
Empower learning-to-rank with language models
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-12-01
Page 1 of 135