Results 251 to 260 of about 71,380 (295)
Some of the next articles are maybe not open access.
The Running Intersection Relaxation of the Multilinear Polytope
Mathematics of Operations Research, 2021The multilinear polytope MPG of a hypergraph G = (V,E) is the convex hull of the set of binary points z ∈ {0, 1} satisfying the collection of multilinear equations ze = ∏ v∈e zv for all e ∈ E.
Alberto Del Pia, Aida Khajavirad
exaly +2 more sources
The Multilinear Polytope for Acyclic Hypergraphs
SIAM Journal on Optimization, 2018Alberto Del Pia, Aida Khajavirad
exaly +2 more sources
Optics Letters, 2004
Polytopic multiplexing is a new method of overlapping holograms that, when combined with other multiplexing techniques, can increase the capacity of a volume holographic data storage system by more than a factor of 10. This is because the method makes possible the effective utilization of thick media.
Ken, Anderson, Kevin, Curtis
openaire +2 more sources
Polytopic multiplexing is a new method of overlapping holograms that, when combined with other multiplexing techniques, can increase the capacity of a volume holographic data storage system by more than a factor of 10. This is because the method makes possible the effective utilization of thick media.
Ken, Anderson, Kevin, Curtis
openaire +2 more sources
Journal of Optimization Theory and Applications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattacharjee, R +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattacharjee, R +2 more
openaire +2 more sources
Russian Mathematical Surveys, 2015
Oberwolfach Preprints;2015 ...
Yu Panina, G., Streinu, I.
openaire +2 more sources
Oberwolfach Preprints;2015 ...
Yu Panina, G., Streinu, I.
openaire +2 more sources
The Annals of Mathematics, 1992
The authors consider projections \(\pi: P\to Q\) between convex polytopes. For each \(x\in Q\) the fiber \(\pi^{-1}(x)\) is again a convex polytope, and the average of \(\pi^{-1}(x)\) over all \(x\in Q\) is called the fiber polytope \(\Sigma(P,Q)\). Its precise definition is given in terms of the Minkowski integral which is the average of the integral ...
Billera, Louis J., Sturmfels, Bernd
openaire +1 more source
The authors consider projections \(\pi: P\to Q\) between convex polytopes. For each \(x\in Q\) the fiber \(\pi^{-1}(x)\) is again a convex polytope, and the average of \(\pi^{-1}(x)\) over all \(x\in Q\) is called the fiber polytope \(\Sigma(P,Q)\). Its precise definition is given in terms of the Minkowski integral which is the average of the integral ...
Billera, Louis J., Sturmfels, Bernd
openaire +1 more source
Lasso screening rules via dual polytope projection
Journal of machine learning research, 2012Lasso is a widely used regression technique to find sparse representations. When the dimension of the feature space and the number of samples are extremely large, solving the Lasso problem remains challenging.
Jie Wang, Peter Wonka, Jieping Ye
semanticscholar +1 more source
Polytope Projection and Projection Polytopes
The American Mathematical Monthly, 1996Imagine yourself as the commander of a space ship. Liftoff was a piece of cake, and since then you have been gliding merrily along. But then comes the bad news: A Klingon ship is approaching, and you must prepare for the attack. More bad news: Your batteries are running low!
Thomas Burger +2 more
openaire +1 more source
Translational tilings by a polytope, with multiplicity
Comb., 2011We study the problem of covering ℤd by overlapping translates of a convex polytope, such that almost every point of ℤd is covered exactly k times. Such a covering of Euclidean space by a discrete set of translations is called a k-tiling.
N. Gravin, S. Robins, D. Shiryaev
semanticscholar +1 more source
Newton Polytopes and Chow Polytopes
1994Suppose we have a complicated (Laurent) polynomial f(x 1,..., x k ) in k variables. Let A be the set of monomials in f with non-zero coefficients. As we have seen in Chapter 5, to understand the structure of f, it is natural to consider it as a member of the space C A of all polynomials whose monomials belong to A.
Israel M. Gelfand +2 more
openaire +1 more source