Results 111 to 120 of about 235 (177)
Learning Continuous Decomposable Models Using Mutual Information and Statistical Copulas
EntropyLearning dependence graphs from multivariate continuous data is challenging when marginal distributions are heterogeneous, since likelihood-based nonparametric scores can be sensitive to smoothing choices and can confound marginal irregularities ...
Luiz Desuó Neto +3 more
doaj +1 more source
Cancer Science, EarlyView.Comparison of extracellular vesicles with parental cells through proteomic profiling, followed by an integrated bioinformatic pipeline including disease association and transcriptomic analyses, identifies candidate biomarkers for multiple myeloma. Among these, MIF emerges as a clinically relevant marker, supported by validation in patient samples and ...
Natalia Platonova +13 more
wiley +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
Backbone colouring of chordal graphs
Procedia Computer ScienceA proper $k$-colouring of a graph $G=(V,E)$ is a function $c: V(G)\to \{1,\ldots,k\}$ such that $c(u)\neq c(v)$ for every edge $uv\in E(G)$. The chromatic number $χ(G)$ is the minimum $k$ such that there exists a proper $k$-colouring of $G$. Given a spanning subgraph $H$ of $G$, a $q$-backbone $k$-colouring of $(G,H)$ is a proper $k$-colouring $c$ of ...
Araújo, Júlio +2 more
openaire +4 more sources
Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure
AxiomsThe efficient minus domination problem (EMDP) and the efficient signed domination problem (ESDP) are domination-type problems in graphs. These problems are known to be NP-complete on chordal graphs and polynomially solvable on chain interval graphs ...
Chuan-Min Lee
doaj +1 more source
Survey on Visualization of Information Diffusion over Networks
Computer Graphics Forum, EarlyView.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
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Computer Graphics Forum, EarlyView.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
Graph classes related to chordal graphs and chordal bipartite graphs
Electronic Notes in Discrete Mathematics, 2006 Nguyen Ngoc Tuy +2 more
openaire +1 more source