Log in

Relevant bibliographies by topics / Riemannian metric and distance / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Riemannian metric and distance.

Dissertations / Theses on the topic 'Riemannian metric and distance'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Riemannian metric and distance.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Suzuki, Kohei. "Convergence of stochastic processes on varying metric spaces." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Palmer, Ian Christian. "Riemannian geometry of compact metric spaces." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34744.

Full text

Abstract:

A construction is given for which the Hausdorﬀ measure and dimension of an arbitrary abstract compact metric space (X, d) can be encoded in a spectral triple. By introducing the concept of resolving sequence of open covers, conditions are given under which the topology, metric, and Hausdorﬀ measure can be recovered from a spectral triple dependent on such a sequence. The construction holds for arbitrary compact metric spaces, generalizing previous results for fractals, as well as the original setting of manifolds, and also holds when Hausdorﬀ and box dimensions diﬀer---in particular, it does n

APA, Harvard, Vancouver, ISO, and other styles

3

Choy, Tze Leung. "Sparse distance metric learning." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:a98695a3-0a60-448f-9ec0-63da3c37f7fa.

Full text

Abstract:

A good distance metric can improve the accuracy of a nearest neighbour classifier. Xing et al. (2002) proposed distance metric learning to find a linear transformation of the data so that observations of different classes are better separated. For high-dimensional problems where many un-informative variables are present, it is attractive to select a sparse distance metric, both to increase predictive accuracy but also to aid interpretation of the result. In this thesis, we investigate three different types of sparsity assumption for distance metric learning and show that sparse recovery is pos

APA, Harvard, Vancouver, ISO, and other styles

4

Chang, Hong. "Semi-supervised distance metric learning /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20CHANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Christiansen, Tom. "Stochastic calculus in Riemannian polyhedra and martingales in metric spaces." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=983734232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Alekseevsky, Dmitri, Andreas Kriegl, Mark Losik, Peter W. Michor, and Peter Michor@esi ac at. "The Riemannian Geometry of Orbit Spaces. The Metric, Geodesics, and." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi997.ps.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Persson, Nicklas. "Shortest paths and geodesics in metric spaces." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-66732.

Full text

Abstract:

This thesis is divided into three part, the first part concerns metric spaces and specically length spaces where the existence of shortest path between points is the main focus. In the second part, an example of a length space, the Riemannian geometry will be given. Here both a classical approach to Riemannian geometry will be given together with specic results when considered as a metric space. In the third part, the Finsler geometry will be examined both with a classical approach and trying to deal with it as a metric space.

APA, Harvard, Vancouver, ISO, and other styles

8

Fuschino, Andrea. "Deep Meta Metric Learning via Learnable Distance." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text

Abstract:

In this thesis work, we propose a Deep Metric Learning method via learnable distance to solve image retrieval problems. Unlike the conventional approaches where a certain predefined distance is used (such as the most commonly Euclidean distance) to compute the dissimilarity between embeddings, what we propose is to learn this distance with a neural network. This learned distance has the objective of performing better than a certain target distance (such as the Euclidean distance), trying to put the examples belonging to the same class closer and the examples belonging to different classes fart

APA, Harvard, Vancouver, ISO, and other styles

9

Law, Marc Teva. "Distance metric learning for image and webpage comparison." Thesis, Paris 6, 2015. http://www.theses.fr/2015PA066019/document.

Full text

Abstract:

Cette thèse se focalise sur l'apprentissage de distance pour la comparaison d'images ou de pages Web. Les distances (ou métriques) sont exploitées dans divers contextes de l'apprentissage automatique et de la vision artificielle tels que la recherche des k plus proches voisins, le partitionnement, les machines à vecteurs de support, la recherche d'information/images, la visualisation etc. Nous nous intéressons dans cette thèse à l'apprentissage de fonction de distance paramétrée par une matrice symétrique semi-définie positive. Ce modèle, appelé (par abus) apprentissage de distance de Mahalano

APA, Harvard, Vancouver, ISO, and other styles

10

Law, Marc Teva. "Distance metric learning for image and webpage comparison." Electronic Thesis or Diss., Paris 6, 2015. http://www.theses.fr/2015PA066019.

Full text

Abstract:

Cette thèse se focalise sur l'apprentissage de distance pour la comparaison d'images ou de pages Web. Les distances (ou métriques) sont exploitées dans divers contextes de l'apprentissage automatique et de la vision artificielle tels que la recherche des k plus proches voisins, le partitionnement, les machines à vecteurs de support, la recherche d'information/images, la visualisation etc. Nous nous intéressons dans cette thèse à l'apprentissage de fonction de distance paramétrée par une matrice symétrique semi-définie positive. Ce modèle, appelé (par abus) apprentissage de distance de Mahalano

APA, Harvard, Vancouver, ISO, and other styles

11

Powell, J. E. "Metric versus non-metric skeletal traits : which is the more reliable indicator of genetic distance?" Thesis, University of Bristol, 1989. http://hdl.handle.net/1983/e44b5162-0f9d-4f0a-afdf-2eac49563e4b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Zhang, Hauyi. "Similarity Search in Continuous Data with Evolving Distance Metric." Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-theses/1253.

Full text

Abstract:

Similarity search is a task fundamental to many machine learning and data analytics applications, where distance metric learning plays an important role. However, since modern online applications continuously produce objects with new characteristics which tend to change over time, state-of-the-art similarity search using distance metric learning methods tends to fail when deployed in such applications without taking the change into consideration. In this work, we propose a Distance Metric Learning-based Continuous Similarity Search approach (CSS for short) to account for the dynamic nature of

APA, Harvard, Vancouver, ISO, and other styles

13

Christopher, Ryan M. "OPTIMIZATION OF SYMBOL DISTANCE METRIC IN DIRECTIONAL MODULATION SYSTEMS." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624230.

Full text

Abstract:

This paper investigates a directional modulation (DM) method that distorts the received symbol constellations along a set of undesired directions while maintaining an undistorted constellation in the direction of intended communications. The problem is formulated in terms of minimization of the symbol distance metrics along the undesired directions. An algorithm assigns a symbol pair to each undesired direction for symbol distance minimization. Constraints for good reception in the desired direction are also included. The method involves iterations between a quadratic minimization problem

APA, Harvard, Vancouver, ISO, and other styles

14

Fang, Xiao Ph D. Massachusetts Institute of Technology. "Bayesian distance metric learning on i-vector for speaker verification." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84870.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 63-66).<br>This thesis explores the use of Bayesian distance metric learning (Bayes_dml) for the task of speaker verification using the i-vector feature representation. We propose a framework that explores the distance constraints between i-vector pairs from the same speaker and different speakers. With an approximation of the distance metric as a weighted covariance matrix of the top eigenvector

APA, Harvard, Vancouver, ISO, and other styles

15

Chowdhury, Samir. "Metric and Topological Approaches to Network Data Analysis." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555420352147114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ahmed, Naveed, and Waqas Ahmed. "Classification of perfect codes and minimal distances in the Lee metric." Thesis, Linnaeus University, School of Computer Science, Physics and Mathematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-6574.

Full text

Abstract:

<p>Perfect codes and minimal distance of a code have great importance in the study of theoryof codes. The perfect codes are classified generally and in particular for the Lee metric.However, there are very few perfect codes in the Lee metric. The Lee metric hasnice properties because of its definition over the ring of integers residue modulo q. It isconjectured that there are no perfect codes in this metric for q > 3, where q is a primenumber.The minimal distance comes into play when it comes to detection and correction oferror patterns in a code. A few bounds on the number of codewords and mi

APA, Harvard, Vancouver, ISO, and other styles

17

Bettiol, Renato Ghini. "Generic properties of semi-Riemannian geodesic flows." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-21072010-170243/.

Full text

Abstract:

Let M be a possibly non compact smooth manifold. We study genericity in the C^k topology (3<=k<=+infty) of nondegeneracy properties of semi-Riemannian geodesic flows on M. Namely, we prove a new version of the Bumpy Metric Theorem for a such M and also genericity of metrics that do not possess any degenerate geodesics satisfying suitable endpoints conditions. This extends results of Biliotti, Javaloyes and Piccione for geodesics with fixed endpoints to the case where endpoints lie on a compact submanifold P of MxM that satisfies an admissibility condition. Immediate consequences are generic no

APA, Harvard, Vancouver, ISO, and other styles

18

Bellet, Aurélien. "Supervised metric learning with generalization guarantees." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00770627.

Full text

Abstract:

In recent years, the crucial importance of metrics in machine learningalgorithms has led to an increasing interest in optimizing distanceand similarity functions using knowledge from training data to make them suitable for the problem at hand.This area of research is known as metric learning. Existing methods typically aim at optimizing the parameters of a given metric with respect to some local constraints over the training sample. The learned metrics are generally used in nearest-neighbor and clustering algorithms.When data consist of feature vectors, a large body of work has focused on lear

APA, Harvard, Vancouver, ISO, and other styles

19

Samuel, Javed K. K. "Lower bounds for embedding the Earth Mover Distance metric into normed spaces." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33346.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.<br>Includes bibliographical references (p. 71-73).<br>This thesis presents a lower bounds for embedding the Earth Mover Distance (EMID) metric into normed spaces. The EMID is a metric over two distributions where one is a mass of earth spread out in space and the other is a collection of holes in that same space. The EMD between these two distributions is defined as the least amount of work needed to fill the holes with earth. The EMD metric is used in a number of applications,

APA, Harvard, Vancouver, ISO, and other styles

20

Alotaibi, Khaled. "Non-metric multi-dimensional scaling for distance-based privacy-preserving data mining." Thesis, University of East Anglia, 2014. https://ueaeprints.uea.ac.uk/52228/.

Full text

Abstract:

Recent advances in the field of data mining have led to major concerns about privacy. Sharing data with external parties for analysis puts private information at risk. The original data are often perturbed before external release to protect private information. However, data perturbation can decrease the utility of the output. A good perturbation technique requires balance between privacy and utility. This study proposes a new method for data perturbation in the context of distance-based data mining. We propose the use of non-metric multi-dimensional scaling (MDS) as a suitable technique to pe

APA, Harvard, Vancouver, ISO, and other styles

21

Bahuaud, Eric. "Intrinsic characterization of asymptotically hyperbolic metrics /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/5781.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Arcostanzo, Marc. "Rigidité et prolongement au disque d'une distance sur le bord." Université Joseph Fourier (Grenoble), 1994. http://www.theses.fr/1994GRE10216.

Full text

Abstract:

Etant donne une distance d sur le bord d'un disque de dimension deux, nous cherchons dans cette these a prolonger d en une distance sur le disque tout entier, de telle sorte que l'espace metrique obtenu soit un espace de longueur, par exemple une metrique riemannienne ou finslerienne. Le prolongement est dit rigide s'il est unique a isometrie pres. Des resultats de rigidite ont ete obtenus par r. Michel, j. P. Otal et c. B. Croke en se restreignant aux metriques riemanniennes. Nous prouvons ici la rigidite des metriques euclidiennes a singularites coniques de courbures negatives. Nous donnons

APA, Harvard, Vancouver, ISO, and other styles

23

Saha, Abhijoy. "A Geometric Framework for Modeling and Inference using the Nonparametric Fisher–Rao metric." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1562679374833421.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Le, Thanh Tam. "Geometry-Aware Learning Algorithms for Histogram Data Using Adaptive Metric Embeddings and Kernel Functions." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/204594.

Full text

Abstract:

Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(情報学)<br>甲第19417号<br>情博第596号<br>新制||情||104(附属図書館)<br>32442<br>京都大学大学院情報学研究科知能情報学専攻<br>(主査)教授山本章博, 教授黒橋禎夫, 教授鹿島久嗣, 准教授 Cuturi Marco<br>学位規則第4条第1項該当

APA, Harvard, Vancouver, ISO, and other styles

25

Lewis, William D. "Measuring conceptual distance using WordNet: the design of a metric for measuring semantic similarity." University of Arizona Linguistics Circle, 2001. http://hdl.handle.net/10150/126645.

Full text

Abstract:

This paper describes the development of a metric for measuring the semantic distance or similarity of words using the WordNet lexical database. Such a metric could be of use in development of search engines and text retrieval systems, tasks for which the richness of natural language can cause difficulty. Further, such a metric can prove invaluable to psycholinguists who wish to study lexical semantic similarity or speech errors (specifically malapropisms). The paper first explores an adjusted distance metric, a la Rada et al. 1989, and the problems such a metric presents. Additional analysis s

APA, Harvard, Vancouver, ISO, and other styles

26

Enders, Joerg. "Generalizations of the reduced distance in the Ricci flow - monotonicity and applications." Diss., Connect to online resource - MSU authorized users, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

27

StClair, Jessica Lindsey. "Geometry of Spaces of Planar Quadrilaterals." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/26887.

Full text

Abstract:

The purpose of this dissertation is to investigate the geometry of spaces of planar quadrilaterals. The topology of moduli spaces of planar quadrilaterals (the set of all distinct planar quadrilaterals with fixed side lengths) has been well-studied [5], [8], [10]. The symplectic geometry of these spaces has been studied by Kapovich and Millson [6], but the Riemannian geometry of these spaces has not been thoroughly examined. We study paths in the moduli space and the pre-moduli space. We compare intraplanar paths between points in the moduli space to extraplanar paths between those same points

APA, Harvard, Vancouver, ISO, and other styles

28

PALMISANO, Vincenzo. "Topics in calculus and geometry on metric spaces." Doctoral thesis, Università degli Studi di Palermo, 2022. https://hdl.handle.net/10447/554772.

Full text

Abstract:

In this thesis we present an overview of some important known facts related to topology, geometry and calculus on metric spaces. We discuss the well known problem of the existence of a lipschitz equivalent metric to a given quasiultrametric, revisiting known results and counterexamples and providing some new theorems, in an unified approach. Also, in the general setting of a quasi-metric doubling space, suitable partition of unity lemmas allows us to obtain, in step two Carnot groups, the well known Whitney’s extension theorem for a given real function of class C^m defined on a closed s

APA, Harvard, Vancouver, ISO, and other styles

29

Miško, Lukáš. "Optimalizace směrování v protokolu Ad hoc On-Demand Distance Vector." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-413102.

Full text

Abstract:

This thesis contains a theoretical basis for MANET networks. The main focus of the thesis is principles of these networks, their routing protocols and especially on Ad hoc On-Demand Distance Vector (AODV), implementation of this protocol and implementation of new mechanis for peer selection. Thesis contains ETX metric basic and implementation of this metric to AODV protocol. There is a demonstration of simulation of AODV protocol and simulation of AODV-ETX protocol. Simulations are run in Network Simulator 3. AODV and AODV-ETX comparasion are included in thesis.

APA, Harvard, Vancouver, ISO, and other styles

30

Papadimitriou, Panayiotis D. "Code design based on metric-spectrum and applications." Texas A&M University, 2004. http://hdl.handle.net/1969.1/1365.

Full text

Abstract:

We introduced nested search methods to design (n, k) block codes for arbitrary channels by optimizing an appropriate metric spectrum in each iteration. For a given k, the methods start with a good high rate code, say k/(k + 1), and successively design lower rate codes up to rate k/2^k corresponding to a Hadamard code. Using a full search for small binary codes we found that optimal or near-optimal codes of increasing length can be obtained in a nested manner by utilizing Hadamard matrix columns. The codes can be linear if the Hadamard matrix is linear and non-linear otherwise. The design metho

APA, Harvard, Vancouver, ISO, and other styles

31

He, Qiangsen. "Person Re-identification Based on Kernel Local Fisher Discriminant Analysis and Mahalanobis Distance Learning." Thesis, Université d'Ottawa / University of Ottawa, 2017. http://hdl.handle.net/10393/36044.

Full text

Abstract:

Person re-identification (Re-ID) has become an intense research area in recent years. The main goal of this topic is to recognize and match individuals over time at the same or different locations. This task is challenging due to the variation of illumination, viewpoints, pedestrians’ appearance and partial occlusion. Previous works mainly focus on finding robust features and metric learning. Many metric learning methods convert the Re-ID problem to a matrix decomposition problem by Fisher discriminant analysis (FDA). Mahalanobis distance metric learning is a popular method to measure similari

APA, Harvard, Vancouver, ISO, and other styles

32

Calisti, Matteo. "Differential calculus in metric measure spaces." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/21781/.

Full text

Abstract:

L'obbiettivo di questa tesi è la definizione del calcolo differenziale e dell'operatore di Laplace in spazi metrici di misura. Nel primo capitolo vengono introdotte le definizioni e proprietà principali degli spazi metrici di misura mentre nel secondo quelle riguardanti le funzioni lipschitziane e la derivata metrica di curve assolutamente continue. Nel terzo capitolo quindi viene definito il concetto di p-supergradiente debole e di conseguenza la classe di Sobolev S^p. Nel quarto capitolo viene poi studiata la generalizzazione del concetto di differenziale di f applicato al gradiente di g che

APA, Harvard, Vancouver, ISO, and other styles

33

Neo, TohKoon. "A Direct Algorithm for the K-Nearest-Neighbor Classifier via Local Warping of the Distance Metric." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2168.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Kohli, Mathieu. "De la notion de courbure géodésique en géométrie sous-Riemannienne." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLX043/document.

Full text

Abstract:

Dans cette thèse, on présente une notion de courbure géodésique pour les courbes lisses horizontales dans une variété sous-Riemannienne de contact, qui indique dans quelle mesure une courbe est différente d'une géodésique. Cette courbure géodésique se présente sous la forme de deux fonctions qui sont toutes deux identiquement nulles le long d'une courbe lisse horizontale si et seulement si cette dernière courbe est une géodésique. Le résultat principal de cette thèse réside dans l'interprétation métrique que l'on donne de ces fonctions de courbure. Cette interprétation consiste à extraire la c

APA, Harvard, Vancouver, ISO, and other styles

35

Neo, Toh Koon Charlie. "A direct boosting algorithm for the k-nearest neighbor classifier via local warping of the distance metric /." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2168.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Huffman, Michaela. "Biological Variation in South American Populations using Dental Non-Metric Traits: Assessment of Isolation by Time and Distance." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1407958702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

O'Loan, Caleb J. "Topics in estimation of quantum channels." Thesis, University of St Andrews, 2010. http://hdl.handle.net/10023/869.

Full text

Abstract:

A quantum channel is a mapping which sends density matrices to density matrices. The estimation of quantum channels is of great importance to the field of quantum information. In this thesis two topics related to estimation of quantum channels are investigated. The first of these is the upper bound of Sarovar and Milburn (2006) on the Fisher information obtainable by measuring the output of a channel. Two questions raised by Sarovar and Milburn about their bound are answered. A Riemannian metric on the space of quantum states is introduced, related to the construction of the Sarovar and Milbur

APA, Harvard, Vancouver, ISO, and other styles

38

Le, Brigant Alice. "Probability on the spaces of curves and the associated metric spaces via information geometry; radar applications." Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0640/document.

Full text

Abstract:

Nous nous intéressons à la comparaison de formes de courbes lisses prenant leurs valeurs dans une variété riemannienne M. Dans ce but, nous introduisons une métrique riemannienne invariante par reparamétrisations sur la variété de dimension infinie des immersions lisses dans M. L’équation géodésique est donnée et les géodésiques entre deux courbes sont construites par tir géodésique. La structure quotient induite par l’action du groupe des reparamétrisations sur l’espace des courbes est étudiée. À l’aide d’une décomposition canonique d’un chemin dans un fibré principal, nous proposons un algor

APA, Harvard, Vancouver, ISO, and other styles

39

Pfeifer, John. "Novel Data Structures for Advanced Computational Movement Analysis." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/27296.

Full text

Abstract:

In this work we present novel data structures and algorithms that answer queries on movement data, which is defined as the recording of an object's spatial location over a set of discrete time intervals. Specifically, we describe three extensive studies that propose new solutions to the problem of proximity searches on trajectory data under the continuous Fréchet distance. We provide both theoretical analysis and experimental results that improve over previous work. The first study discusses a scalable approach for range and k-nearest-neighbor trajectory queries on an input trajectory data se

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Jian. "Les 3-variétés contractiles et courbure scalaire positive." Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAM076.

Full text

Abstract:

Un des objectifs de ce mémoire est de comprendre les espaces munis de métrique complète de courbure scalaire positive. Il y a plusieurs obstructions topologiques à l'existence d'une métrique complète de courbure scalaire positive. Notre but est de trouver toutes les obstructions pour les variétés contractiles de dimension 3 et les variétés fermées de dimension 4.En dimension 3, nous considèrons la question de savoir si une variété contractile complète de courbure scalaire positive est homéomorphe à mathbb{R} 3. La structure topologique des variétés contractiles de dimension 3 est assez compliq

APA, Harvard, Vancouver, ISO, and other styles

41

Hiransakolwong, Nualsawat. "AUTOMATIC ANNOTATION OF DATABASE IMAGES FOR QUERY-BY-CONCEPT." Doctoral diss., University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2639.

Full text

Abstract:

As digital images become ubiquitous in many applications, the need for efficient and effective retrieval techniques is more demanding than ever. Query by Example (QBE) and Query by Concept (QBC) are among the most popular query models. The former model accepts example images as queries and searches for similar ones based on low-level features such as colors and textures. The latter model allows queries to be expressed in the form of high-level semantics or concept words, such as "boat" or "car," and finds images that match the specified concepts. Recent research has focused on the connections

APA, Harvard, Vancouver, ISO, and other styles

42

Bouvattier, Marc-Antoine. "Unstructured mesh adaptation for turbo-machinery RANS computation." Thesis, KTH, Flygdynamik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211161.

Full text

Abstract:

This paper gives an overview of the mathematical and practical tools that can be used in turbo-machinery RANS simulation to realize unstructured mesh adaptation. It first presents the concept of metric and recalls that the hessian of the physical flow properties can become, thanks to small modifications, both a metric and a upper bound of the P1 projection error. The resulting metric is then studied on a simple 2D case. In a second part, the industrial application of this concept is addressed and the tools used to overcome the turbo-machinery specificities are explained. Finally, some 2D and 3

APA, Harvard, Vancouver, ISO, and other styles

43

Pant, Dibakar Raj. "Line element and variational methods for color difference metrics." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00981484.

Full text

Abstract:

Visual sensitivity to small color difference is an important factor for precision color matching. Small color differences can be measured by the line element theory in terms of color distances between a color point and neighborhoods of points in a color space. This theory gives a smooth positive definite symmetric metric tensor which describes threshold of color differences by ellipsoids in three dimensions and ellipses in two dimensions. The metric tensor is also known as the Riemannian metric tensor. In regard to the color differences, there are many color difference formulas and color space

APA, Harvard, Vancouver, ISO, and other styles

44

Rojas, Christian Andres. "Demand Estimation with Differentiated Products: An Application to Price Competition in the U.S. Brewing Industry." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/28916.

Full text

Abstract:

A large part of the empirical work on differentiated products markets has focused on demand estimation and the pricing behavior of firms. These two themes are key inputs in important applications such as the merging of two firms or the introduction of new products. The validity of inferences, therefore, depends on accurate demand estimates and sound assumptions about the pricing behavior of firms. This dissertation makes a contribution to this literature in two ways. First, it adds to previous techniques of estimating demand for differentiated products. Second, it extends previous analyses of

APA, Harvard, Vancouver, ISO, and other styles

45

Pola, Ives Renê Venturini. "Indexação de dados em domínios métricos generalizáveis." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-14072005-150243/.

Full text

Abstract:

Os sistemas Gerenciadores de Bases de Dados (SGBDs) foram desenvolvidos para manipular domínios de dados numéricos e/ou pequenas seqüencias de caracteres (palavras) e não foram projetados prevendo a manipulação de dados complexos, como por exemplo dados multimídia. Os operadores em domínios de dados que requisitam a relação de ordem têm pouca utilidade para manipular operações que envolvem dados complexos. Uma classe de operadores que se adequa melhor para manipular esses dados são os operadores por similaridade: consulta por abrangência (``range queries') e consulta de vizinhos mais próximos

APA, Harvard, Vancouver, ISO, and other styles

46

Kephart, David E. "Topology, morphisms, and randomness in the space of formal languages." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Gigli, Nicola. "Proprietes geometriques et analytiques de certaines structures non lisses." Habilitation à diriger des recherches, Université de Nice Sophia-Antipolis, 2011. http://tel.archives-ouvertes.fr/tel-00769381.

Full text

Abstract:

This work is to give an overview over the research that I've done up to now. The overall idea behind my interests has been that of understanding analytical and geometrical properties of non smooth spaces both from both a theoretical and a practical point of view. The two main classes of spaces on which I focussed are: the Wasserstein space (P2(M),W2) built over a Riemannian manifold, and abstract metric and metric-measure spaces, in particular those with Ricci curvature bounded below.

APA, Harvard, Vancouver, ISO, and other styles

48

Tran, Anh Tuyet. "1p spaces." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Danijela, Karaklić. "Prostori sa fazi rastojanjem i primena u obradi slike." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2019. https://www.cris.uns.ac.rs/record.jsf?recordId=110710&source=NDLTD&language=en.

Full text

Abstract:

Merenje kvaliteta slike korišćenjem indeksa za kvalitet slike, ne mora da odražava i praktični kvalitet slike, odnosno nije baziran na HVS (Human visual system) modelu. Formiranje razmatranih funkcija, koje se koriste u algoritmu filtriranja za određivanje rastojanja među pikselima, može se vršiti  na različite načine, što se može videti u radovima iz oblasti filtriranja slike, daje širok spektar mogućnosti da se ispita uticaj fazi rastojanja npr. fazi T-metrike ili fazi Ѕ-metrike mogu imati na sam proces filtriranja slike. Cilj je poboljšanje kvaliteta slike u odnosu na medijanski filter

APA, Harvard, Vancouver, ISO, and other styles

50

Marinchek, Dean A. "Manufacturing Facility Layout: A Methodology Incorporating Rotated Aisles into Layout Design." Ohio University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1417537173.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!