Results 41 to 50 of about 655,112 (194)
Similar image retrieval in large-scale trademark databases based on regional and boundary fusion feature. [PDF]
PLoS ONE, 2018 In order to retrieve similar trademarks from large-scale trademark databases, combining the characteristics of trademark images, this paper presents a trademark image retrieval method based on regional and border feature fusion. Based on the target image
Meihong Wu, Wenbin Xiao, Zhiling Hong
doaj +1 more source
Gateway Deployment Optimization in Wireless Mesh Backbone Network Based on Closeness Centrality
Dianxin kexue, 2015 Directional antenna and Delaunay graph were used in the gateway deployment optimization of wireless mesh backbone network and a gateway deployment optimization algorithm of wireless mesh backbone network based on closeness centrality was proposed ...
Chengxin Guo, Taoshen Li, Zhihui Ge
doaj +2 more sources
Flipping geometric triangulations on hyperbolic surfaces
Journal of Computational GeometryWe consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface
Vincent Despre +2 more
doaj +1 more source
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
Advanced Intelligent Discovery, EarlyView.This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
Coloring lines and Delaunay graphs with respect to boxes
Random Structures & Algorithms, 2023 AbstractThe goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of lines in whose intersection graph is triangle‐free of chromatic number .
openaire +5 more sources
Competitive local routing with constraints
Journal of Computational Geometry, 2017 Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$, called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints.
Prosenjit Bose +3 more
doaj +1 more source
Arthritis &Rheumatology, Accepted Article.Objective Systemic sclerosis (SSc) is a chronic autoimmune disorder characterized by immune dysregulation and fibrosis, with myeloid‐derived suppressor cells (MDSCs) emerging as important regulators of immune responses. However, the role of MDSCs in SSc‐associated fibrosis and their interactions with other immune cell populations remain poorly ...
Stefanie Weber +15 more
wiley +1 more source
Graph-theoretical conditions for inscribability and Delaunay realizability
Discrete Mathematics, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillencourt, Michael B. +1 more
openaire +3 more sources
Real‐Time Conformal Maps and Parameterizations
Computer Graphics Forum, EarlyView.Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
Fingerprint verification using computational geometry
Dyna, 2016 This paper presents a robust minutiae based method for fingerprint verification. The proposed method uses Delaunay Triangulation to represent minutiae as nodes of a connected graph composed of triangles.
Manuel Ramírez Flores +3 more
doaj +1 more source