Results 51 to 60 of about 6,450,253 (299)
Approximation Algorithms for $\ell_0$-Low Rank Approximation
CoRR, 2017 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
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Rémi Gribonval, Morten Nielsen 0002
openaire +3 more sources
Approximation Algorithms for Intersection Graphs [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Kammer, Torsten Tholey
openaire +3 more sources
Efficient Algorithms for Coded Multicasting in Heterogeneous Caching Networks
Entropy, 2019 Coded multicasting has been shown to be a promising approach to significantly improve the performance of content delivery networks with multiple caches downstream of a common multicast link.
Giuseppe Vettigli +5 more
doaj +1 more source
Approximate Discrete Reconstruction Algorithm [PDF]
Fundamenta Informaticae, 2013 Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
K.J. Batenburg (Joost) +2 more
openaire +4 more sources
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +3 more sources
Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
Scheduling Non-Preemptible Jobs to Minimize Peak Demand
Algorithms, 2017 This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing
Sean Yaw, Brendan Mumey
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz +12 more
wiley +1 more source