Results 41 to 50 of about 1,003,970 (287)
Approximation Algorithms for $\ell_0$-Low Rank Approximation
We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +4 more sources
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem.
C. Thielen +14 more
core +1 more source
Line-distortion, Bandwidth and Path-length of a graph [PDF]
We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta +15 more
core +1 more source
Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups [PDF]
The little Grothendieck problem consists of maximizing $\sum_{ij}C_{ij}x_ix_j$ over binary variables $x_i\in\{\pm1\}$, where C is a positive semidefinite matrix.
Bandeira, Afonso S. +2 more
core +2 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Radio Mean Labeling Algorithm, Its Complexity and Existence Results
Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio
Meera Saraswathi +2 more
doaj +1 more source
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
A tight lower bound instance for k-means++ in constant dimension [PDF]
The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial $k$ centers when using the k-means heuristic.
A. Aggarwal +6 more
core +1 more source
Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley +5 more
wiley +1 more source
Approximating a Minimum Dominating Set by Purification
A dominating set of a graph is a subset of vertices such that every vertex not in the subset has at least one neighbor within the subset. The corresponding optimization problem is known to be NP-hard.
Ernesto Parra Inza +3 more
doaj +1 more source

