Results 41 to 50 of about 8,591 (298)
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem
We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
The offshore plant, due to its characteristics, is subject to many restrictions on the material and design of the pipes. Because the design of the firefighting piping depends on the pre-set fire protection design, it is possible to reduce the cost of the
Byeong Cheol Lee +2 more
doaj +1 more source
On a greedy approach for genome scaffolding
Background Scaffolding is a bioinformatics problem aimed at completing the contig assembly process by determining the relative position and orientation of these contigs. It can be seen as a paths and cycles cover problem of a particular graph called the “
Tom Davot +4 more
doaj +1 more source
Greedy Bayesian Posterior Approximation with Deep Ensembles
Published in the Transactions on Machine Learning Research: https://openreview.net/forum?id ...
Tiulpin, Aleksei, Blaschko, Matthew
openaire +4 more sources
Algorithms and error bounds for multivariate piecewise constant approximation
We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Oleg Davydov, Davydov, Oleg
core +1 more source
Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries
We study the approximation capability of the orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. We establish the Lebesgue-type inequalities for OSGA, which show that the OSGA provides an almost optimal ...
Chunfang Shao +4 more
doaj +1 more source
Sparse Approximation by Greedy Algorithms [PDF]
It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse approximation with respect to the trigonometric system, (3) sparse approximation with respect to dictionaries with ...
openaire +2 more sources
Convergence of greedy approximation for the trigonometric system [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konyagin, S. V., Temlyakov, V. N.
openaire +3 more sources
Toward Optimal Placement of Spatial Sensors to Detect Poisson-Distributed Targets
This paper addresses the challenges of optimally placing a finite number of sensors to detect Poisson-distributed targets in a bounded domain. We seek to rigorously account for uncertainty in the target arrival model throughout the problem.
Mingyu Kim +5 more
doaj +1 more source
ABSTRACT Background Children with acute lymphoblastic leukemia (ALL) are at risk of severe outcomes from SARS‐CoV‐2 (SCV2). In the post‐pandemic context, where most children have been infected with SCV2, there are limited data on whether vaccination remains beneficial in children with ALL.
Janna R. Shapiro +11 more
wiley +1 more source

