Results 71 to 80 of about 2,911 (216)
Class Angular Distortion Index for Dimensionality Reduction
Abstract Dimensionality reduction (DR) techniques are often characterized by whether they preserve global, high‐level structures in the data or local, neighborhood structures. This distinction matters in visualization: global methods can obscure clusters while local methods can over‐emphasize them.
Kaviru Gunaratne +2 more
wiley +1 more source
Constructive algebraic topology
The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert solution for Constructive Algebraic Topology is recalled.
Rubio, J., Sergeraert, F.
openaire +6 more sources
Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
THE ANALOGUE OF WEIGHTED GROUP ALGEBRA FOR SEMITOPOLOGICAL SEMIGROUPS [PDF]
In [1,2,3], A. C. Baker and J.W. Baker studied the subspace Ma(S) of the convolution measure algebra M, (S) of a locally compact semigroup. H. Dzinotyiweyi in [5,7] considers an analogous measure space on a large class of C-distinguished topological ...
doaj
Algebras generated by special symmetric polynomials on $\ell_1$
Let $X$ be a weighted direct sum of infinity many copies of complex spaces $\ell_1\bigoplus \ell_1.$ We consider an algebra consisting of polynomials on $X$ which are supersymmetric on each term $\ell_1\bigoplus \ell_1.$ Point evaluation functionals on ...
F. Jawad, H. Karpenko, A.V. Zagorodnyuk
doaj +1 more source
Survey on Visualization of Information Diffusion over Networks
Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Progressive Convex Hull Simplification
Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley +1 more source
Lattice Operators and Topologies
Working within a complete (not necessarily atomic) Boolean algebra, we use a sublattice to define a topology on that algebra. Our operators generalize complement on a lattice which in turn abstracts the set theoretic operator.
Eva Cogan
doaj +1 more source
Chiral algebras from Ω-deformation
In the presence of an Ω-deformation, local operators generate a chiral algebra in the topological-holomorphic twist of a four-dimensional N $$ \mathcal{N} $$ = 2 supersymmetric field theory.
Jihwan Oh, Junya Yagi
doaj +1 more source
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov +3 more
wiley +1 more source

