[PDF] Top 20 Strongly polynomial algorithm for the intersection of a line with a polymatroid
Has 10000 "Strongly polynomial algorithm for the intersection of a line with a polymatroid" found on our website. Below are the top 20 most common "Strongly polynomial algorithm for the intersection of a line with a polymatroid".
Strongly polynomial algorithm for the intersection of a line with a polymatroid
... study of the strength of a network had an approach based on the forest polytope of a ...ied, for the problem of the strength of a ... Voir le document complet
20
On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem
... is a situation where we can apply Theorem 1. Of course, turning this informal idea into an actual proof requires some ...particular, the algebraic function φ needs not be defined on the whole ... Voir le document complet
19
A Line/Trimmed NURBS Surface Intersection Algorithm Using Matrix Representations
... is a mathematical model that has become the standard in the Computer-Aided Design (CAD) community for generating and representing curves and surfaces with high quality and precision ... Voir le document complet
19
NON-WANDERING FATOU COMPONENTS FOR STRONGLY ATTRACTING POLYNOMIAL SKEW PRODUCTS
... thus the non-wandering domain theorem does not hold for general polynomial skew ...investigate the existence of wandering Fatou components for local polynomial skew ... Voir le document complet
25
A general notion of activity for the Tutte polynomial
... Such a description appeared for the first time in the founding paper of Tutte ...notion of activity required to linearly order the edge ...gave a new notion ... Voir le document complet
39
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
... is a linearized variant of rankwidth, introduced by Oum and Seymour [Approxi- mating clique-width and ...is the linearized variant of treewidth. Motivated from the results on graph ... Voir le document complet
13
Linear Rank-Width of Distance-Hereditary Graphs I. A Polynomial-Time Algorithm
... to the series of papers by Geelen, Gerards, and Whittle on the Matroid Minors Project [16, 18] and Rota’s Conjecture [19] for more information on matroid ...that the matroid branch- ... Voir le document complet
31
Curve reconstruction via line intersection tomography
... Unfortunately there are two major problems with this reconstruction: the number of sampling points is exponential in the accuracy parameter and we do not reconstruct [r] ... Voir le document complet
61
A dynamic Time Warping Algorithm for Recognition of Multi-Stroke On-Line Handwriten Characters
... is a famous distance to compare two mono-stroke symbols ...constraints. The extension of DTW to multi-stroke symbols raises specific ...problems. A naive solution is to convert the ... Voir le document complet
10
A polynomial time algorithm to detect PQI interval orders
... instead of discrete values (see Fishburn, 1985, Pirlot and Vincke, ...to the unavoidable lack of precision and certainty in the evaluation of ...alternatives. The conventional ... Voir le document complet
18
Intersection homology D-Modules and Bernstein polynomials associated with a complete intersection
... coincides with L f if and only if n is odd. These polynomials are famous because of the link of their roots with the monodromy of the Milnor fibration associated ... Voir le document complet
17
A Type Checker for a Logical Framework with Union and Intersection Types
... present the syntax, semantics, typing, subtyping, unification, refinement, and REPL of Bull , a prototype theorem prover based on the ∆-Framework, ...i.e. a fully-typed Logical ... Voir le document complet
25
Near-Optimal Parameterization of the Intersection of Quadrics: I. The Generic Algorithm
... than the algebraic ones, they are essentially limited to the class of so-called natural quadrics ...(i.e., the planes, right cones, circular cylinders and spheres) and planar ...Perhaps ... Voir le document complet
40
A closing lemma for polynomial automorphisms of C^2
... to the experts although apparently not available in print. For semi-Cremer points this follows from the hedgehog construction of Firsova, Lyubich, Radu and Tanase (see ...[LRT]). For ... Voir le document complet
7
Fast polynomial arithmetic for Somewhat Homomorphic Encryption operations in hardware with Karatsuba algorithm
... multiplication. For the first design with 3 recursions, the accelerator can per- form a polynomial multiplication in ...and a relineariza- tion/key switching in ...to ... Voir le document complet
9
Unique decomposition for a polynomial of low rank
... . The natural questions that arose at that workshop from applied people, were about the possi- ble uniqueness of the binary form Q in [2], Corollary 1 ...(ie. the vector v in [2], ... Voir le document complet
5
A bilevel model with a solution algorithm for the network design and pricing problem
... University of Liege (ULg), ...examining the intertwined tactical problems of designing freight carrying services and determining their associated ...forward a bilevel model, where a ... Voir le document complet
1
Towards a Logical Framework with Intersection and Union Types
... two of the present authors extended the logical in- terpretation with union types as another proof-functional operator, the strong union ...point of view, we could say that ... Voir le document complet
10
Resultant over the residual of a complete intersection
... Using the resolution of the ideal (F : G) due to [BKM90] (in the case of a regular sequence g1, ...computing the Castelnuovo-Mumford regularity of this ideal, we ... Voir le document complet
27
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
... sumption of resource X by all tasks in interval [0 , t + 1 ) is denoted by U X ( t ) = j ∈ N u jX ( t ) .... The main idea behind the developed algorithm is to calculate an upper bound on ... Voir le document complet
11
Sujets connexes