Results 21 to 30 of about 8,755 (208)

Polyline simplification has cubic complexity

open access: yesJournal of Computational Geometry, 2021
$\DeclareMathOperator{\poly}{poly}$In the classic polyline simplification problem, given a polygonal curve~$P$ consisting of $n$ vertices and an error threshold $\delta \geq 0$, we want to replace $P$ by a subsequence~$Q$ of minimal size such that the ...
Karl Bringmann, Bhaskar Ray Chaudhury
doaj   +1 more source

The Wire Is Not the Territory: Understanding Representational Drift in Olfaction With Dynamical Systems Theory

open access: yesTopics in Cognitive Science, EarlyView., 2023
Abstract Representational drift is a phenomenon of increasing interest in the cognitive and neural sciences. While investigations are ongoing for other sensory cortices, recent research has demonstrated the pervasiveness in which it occurs in the piriform cortex for olfaction.
Ann‐Sophie Barwich   +1 more
wiley   +1 more source

The Hausdorff Algebra Fuzzy Distance and its Basic Properties [PDF]

open access: yesEngineering and Technology Journal, 2021
In this article we recall the definition of algebra fuzzy metric space and its basic properties. In order to introduced the Hausdorff algebra fuzzy metric from fuzzy compact set to another fuzzy compact set we define the algebra fuzzy distance between ...
Zainab Khudhair, Jehad Kider
doaj   +1 more source

Fully automated segmentation of the pons and midbrain using human T1 MR brain images. [PDF]

open access: yesPLoS ONE, 2014
This paper describes a novel method to automatically segment the human brainstem into midbrain and pons, called labs: Landmark-based Automated Brainstem Segmentation. LABS processes high-resolution structural magnetic resonance images (MRIs) according to
Salvatore Nigro   +10 more
doaj   +1 more source

The Role of Shape Commensurability in Chirality Transfer: Gold Nanoshape Solutes in a Discotic Nematic Liquid Crystal Solvent

open access: yesAngewandte Chemie, EarlyView.
We report on a suitable approach to predict the chirality “strength” and efficacy of chirality transfer from chiral nanoshape solutes to an achiral discotic nematic (ND) liquid crystal solvent. Highly efficacious chirality transfer based on shape commensurability between nanoshape solute (in the form of gold nanodiscs, GNDs) and a ND solvent was ...
Gourab Acharjee   +10 more
wiley   +2 more sources

The Hausdorff–Pompeiu Distance in Gn-Menger Fractal Spaces

open access: yesMathematics, 2022
This paper introduces a complete Gn-Menger space and defines the Hausdorff–Pompeiu distance in the space. Furthermore, we show a novel fixed-point theorem for Gn-Menger-θ-contractions in fractal spaces.
Donal O’Regan   +3 more
doaj   +1 more source

Edge Eigenface Weighted Hausdorff Distance for Face Recognition [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2011
The different face regions have different degrees of importance for face recognition. In previous Hausdorff distance (HD) measures, points are treated as same importance, or weight different points that calculated from gray domain.
Huachun Tan   +6 more
doaj   +1 more source

Some Notes for Two Generalized Trigonometric Families of Distributions

open access: yesAxioms, 2022
The paper deals with two general families of cumulative distribution functions based on arctangent function. We provide analysis of the error of the best one-sided Hausdorff approximation for some special cases of these families.
Maria T. Vasileva
doaj   +1 more source

The Hausdorff core problem on simple polygons

open access: yesJournal of Computational Geometry, 2014
A polygon \(Q\) is a \(k\)-bounded Hausdorff Core of a polygon \(P\) if \(P\) contains \(Q\), \(Q\) is convex, and the Hausdorff distance between \(P\) and \(Q\) is at most \(k\).
Reza Dorrigiv   +7 more
doaj   +1 more source

$k$-Median clustering under discrete Fréchet and Hausdorff distances

open access: yesJournal of Computational Geometry, 2022
We give the first near-linear time (1+ε)-approximation algorithms for k-median clustering of polygonal trajectories under the discrete Fréchet distance, and finite point sets under the Hausdorff distance, provided the complexity of each cluster center ...
Abhinandan Nath, Erin Taylor
doaj   +1 more source

Home - About - Disclaimer - Privacy