Exploració per tema "Euclidean distance"

Ara es mostren els items 1-8 de 8

    • A kernel for time series classification: application to atmospheric pollutants 

      Arias Vicente, Marta; Troncoso, Alicia; Riquelme, José C. (2012)
      Text en actes de congrés
      Accés obert
      In this paper a kernel for time-series data is presented. The main idea of the kernel is that it is designed to recognize as similar time series that may be slightly shifted with one another. Namely, it tries to focus on ...

    • Differentiation with Raman spectroscopy among several natural ultramarine blues and the synthetic ultramarine blue used by the Catalonian modernist painter Ramon Casas i Carbo 

      Ramos de Torres, Antonio; Ruiz Moreno, Sergio; Lopez Gil, A; Ferrer, Pere; Chillon, M.C (2014-11-01)
      Article
      Accés restringit per política de l'editorial
      This paper investigates, using only Raman spectroscopy, the spectral differences among the synthetic ultramarine blue (J. B. Guimet) and three natural ultramarine blues (lazurites) corresponding to three lapis lazulis from ...

    • Euclidean distance between syntactically linked words 

      Ferrer Cancho, Ramon (2004-11)
      Article
      Accés obert
      We study the Euclidean distance between syntactically linked words in sentences. The average distance is significantly small and is a very slowly growing function of sentence length. We consider two nonexcluding hypotheses: ...

    • La distància de l'eixample 

      Greenacre, Michael J. (Institut d'Estadística de Catalunya, 2002)
      Article
      Accés obert
      Inspirándonos en el diseño del Ensanche de Barcelona de Ildefonso Cerdá, definimos una nueva distancia estadística, denominada la distancia del ensanche. Se estudian algunas propiedades de esta función de distancia y se ...

    • On the relation between graph distance and Euclidean distance in random geometric graphs 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Perarnau Llobet, Guillem; Pérez Giménez, Xavier (2016-09-01)
      Article
      Accés obert
      Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ...

    • Reconstruction of random geometric graphs: breaking the Ω(r) distortion barrier 

      Dani, Varsha; Díaz Cort, Josep; Hayes, Thomas P.; Moore, Cristopher (2023-10-03)
      Article
      Accés obert
      Embedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ...

    • Rule-based fuzzy object similarity 

      Bunke, Horst; Fàbregas, Xavier; Kandel, Abraham (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2001)
      Article
      Accés obert
      A new similarity measure for objects that are represented by feature vectors of fixed dimension is introduced. It can simultaneously deal with numeric and symbolic features. Also, it can tolerate missing feature values. ...

    • Strategic consensus between functions and the role of supply chain technology as moderator 

      Kusmantini, Titik; Haryono, Tulus; Untoro, Wisnu; Setiawan, Ahmad Ikhwan (OmniaScience, 2018-12)
      Article
      Accés obert
      Purpose: This study aims to identify whether the degree of fit of the correlation between high supply chain and manufacturing strategy will result in a better performance. Design/methodology/approach: Strategic alignment ...