Results 271 to 280 of about 101,154 (305)

GENERALIZED INTERSECTION SEARCHING PROBLEMS

International Journal of Computational Geometry & Applications, 1993
A new class of geometric intersection searching problems is introduced, which generalizes previously-considered intersection searching problems and is rich in applications. In a standard intersection searching problem, a set S of n geometric objects is to be preprocessed so that the objects that are intersected by a query object q can be reported ...
Ravi Janardan, Mario Alberto López
openaire   +1 more source

Inverse Matroid Intersection Problem

Mathematical Methods of Operations Research, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mao-cheng Cai, Yanjun Li
openaire   +2 more sources

A note on a Maximum k-Subset Intersection problem

Information Processing Letters, 2012
Consider the following problem which we call Maximum k-Subset Intersection (MSI): Given a col-lection C = {S1,..., Sm} of m subsets over a finite set of elements E = {e1,..., en}, and a positive integer k, the objective is to select exactly k subsets Sj1,
Eduardo C Xavier
exaly   +1 more source

The intersection problem for cubes [PDF]

Australas. J Comb., 1997
For all \(m, n \) and \(t\), the authors give necessary and sufficient conditions for the existence of a pair of 3-cube decompositions of the complete graph \(K_n\) having precisely \(t\) common 3-cubes and also for the existence a pair of 3-cube decompositions of the complete bipartite graph \(K_{m,n}\) having precisely \(t\) common 3-cubes.
Peter Adams 0001, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati   +3 more
openaire   +1 more source

The rectangle intersection problem revisited

BIT, 1980
We take another look at the problem of intersecting rectangles with parallel sides. For this we derive a one-pass, time optimal algorithm which is easy to program, generalizes tod dimensions well, and illustrates a basic duality in its data structures and approach.
Hans-Werner Six, Derick Wood
openaire   +1 more source

Lagrangian Intersection and the Cauchy Problem

Communications on Pure and Applied Mathematics, 1979
A symbolic calculus for distributions associated to a pair of Lagrangian manifolds intersecting cleanly with codimension one is developed and applied to give a purely symbolic construction of global parametrices for pseudodifferential operators of real principal type on a pseudoconvex manifold.
Melrose, Richard B., Uhlmann, Gunther
openaire   +2 more sources

The emptiness problem for intersection types

Journal of Symbolic Logic, 1999
AbstractWe study the intersection type assignment system as defined by Barendregt, Coppo and Dezani. For the four essential variants of the system (with and without a universal type and with and without subtyping) we show that the emptiness (inhabitation) problem is recursively unsolvable.
openaire   +1 more source

Inverse Problems of Matroid Intersection

Journal of Combinatorial Optimization, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the inapproximability of maximum intersection problems

Information Processing Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min-Zheng Shieh, Shi-Chun Tsai, Ming-Chuan Yang   +2 more
openaire   +2 more sources

Intersection Inequalities for the Covering Problem

SIAM Journal on Applied Mathematics, 1969
Suppose that one considers the set of \(p^n\) vectors of length \(n\) which may be formed when each component may take one of \(p\) values. Then we define \(\sigma(n,p)\) as the minimal cardinality of a set of vectors which \textit{covers} all \(p^n\) vectors, using the fact that a vector is said to cover itself and the \(n\) vectors which differ from ...
Stanton, R. G., Kalbfleisch, J. G.
openaire   +2 more sources