Results 71 to 80 of about 1,078 (84)

Finding a most parsimonious or likely tree in a network with respect to an alignment. [PDF]

J Math Biol, 2019
Kelk S, Pardi F, Scornavacca C, van Iersel L.   +3 more
europepmc   +1 more source

Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. [PDF]

Math Program, 2017
Liu H, Yao T, Li R, Ye Y.
europepmc   +1 more source

The combinatorics of discrete time-trees: theory and open problems. [PDF]

J Math Biol, 2018
Gavryushkin A, Whidden C, Matsen FA.
europepmc   +1 more source

(Re)packing Equal Disks into Rectangle. [PDF]

Discrete Comput Geom
Fomin FV, Golovach PA, Inamdar T, Saurabh S, Zehavi M.   +4 more
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Effect-Based Weapon-Target Assignment Optimization With Collateral Damage Under Control

, 2016
In this work we optimize an effect-based weapon-target assignment that does not exceed a pre-determined upper bounds P1 ,P 2 ,...,P k for the collateral damage of k types of assets.
Z. R. Bogdanowicz, John K Price, Ketula Patel   +2 more
semanticscholar   +1 more source

Computationally and Efficient Inference for Complex Large-scale Data

, 2016
The aim of the highly successful workshop Computationally and statistically efficient inference for large-scale and heterogeneous data was to foster dissemination and collaboration between researchers in the area of highdimensional and large-scale data ...
G. Blanchard, N. Meinshausen, R. Samworth, M. Yuan   +3 more
semanticscholar   +1 more source

Optimal computation

, 2006
A large portion of computation is concerned with approximating a function u. Typically, there are many ways to proceed with such an approximation leading to a variety of algorithms.
R. DeVore
semanticscholar   +1 more source

Convex Geometry and its Applications

, 2010
The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of other algorithms in computer science ...
M. Rudelson
semanticscholar   +1 more source