Results 1 to 10 of about 265 (117)
AxiomsThis research explores the interplay between violator spaces and greedoids—two distinct theoretical frameworks developed independently. Violator spaces were introduced as a generalization of linear programming, while greedoids were designed to ...
Yulia Kempner +2 more
exaly +4 more sources
Clarkson's algorithm for violator spaces [PDF]
Computational Geometry: Theory and Applications, 2011 Clarksons algorithm is a two-staged randomized algorithm for solving linear programs. This algorithm has been simplified and adapted to fit the framework of LP-type problems. In this framework we can tackle a number of non-linear problems such as computing the smallest enclosing ball of a set of points in R^d .
Bernd Gärtner
exaly +4 more sources
Violator spaces vs closure spaces [PDF]
European Journal of Combinatorics, 2019 Violator Spaces were introduced by J. Matousek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as proper combinatorial abstractions of convexity. Convex geometries are defined by anti-exchange closure operators.
Yulia Kempner, Vadim E Levit
exaly +5 more sources
Cospanning Characterizations of Violator and Co-violator Spaces
Springer Proceedings in Mathematics and StatisticsGiven a finite set E and an operator sigma:2^{E}-->2^{E}, two subsets X,Y of the ground set E are cospanning if sigma(X)=sigma(Y) (Korte, Lovasz, Schrader; 1991). We investigate cospanning relations on violator spaces. A notion of a violator space was introduced in (Gartner, Matousek, Rust, Skovrovn; 2008) as a combinatorial framework that ...
Yulia Kempner +2 more
exaly +3 more sources
Random sampling in computational algebra: Helly numbers and violator spaces
Journal of Symbolic Computation, 2016 This paper transfers a randomized algorithm, originally used in geometric optimization, to computational problems in commutative algebra. We show that Clarkson's sampling algorithm can be applied to two problems in computational algebra: solving large-scale polynomial systems and finding small generating sets of graded ideals.
Jesus A De Loera, Sonja Petrović
exaly +5 more sources
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2023 The article considers the hardware and software complex developed by the authors for the study of the joint use of technical means built on various physical principles. This hardware and software complex is a set of jointly functioning security equipment
E. I. Mikhnionok, A. V. Khizniak
doaj +1 more source
Consistent Lorentz violation in flat and curved space [PDF]
Physical Review D, 2007 Motivated by the severity of the bounds on Lorentz violation in the presence of ordinary gravity, we study frameworks in which Lorentz violation does not affect the spacetime geometry. We show that there are at least two inequivalent classes of spontaneous Lorentz breaking that even in the presence of gravity result in Minkowski space.
Dvali, Gia +2 more
openaire +2 more sources
The MICROSCOPE Space Mission and Lorentz Violation [PDF]
CPT and Lorentz Symmetry, 2020 Presented at the Eighth Meeting on CPT and Lorentz Symmetry, Bloomington, Indiana, May 12-16 ...
Mo, Geoffrey +5 more
openaire +2 more sources
Phase space localization of chaotic eigenstates: Violating ergodicity [PDF]
Physical Review E, 2000 12 pages, 12 figures, submitted to Phys. Rev.
Lakshminarayan, Arul +2 more
openaire +4 more sources
Shortest path in a polygon using sublinear space
Journal of Computational Geometry, 2015 We resolve an open problem due to Tetsuo Asano, showing how to compute the shortest path in a polygon, given in a read only memory, using sublinear space and subquadratic time.
Sariel Har-Peled
doaj +1 more source