Results 281 to 290 of about 101,154 (305)

Bernstein Bezoutians and application to intersection problems

Computer Aided Geometric Design, 2012
The authors study the Bézier curve-surface and Bézier surface-surface intersection problems avoiding the well-known unstable conversion between the Bernstein basis and the power basis. These varieties are given by parametrizations in Bernstein bases and all intermediate computations are performed in that form. For this purpose, an adapted resultant for
Ba, Elimane, Elkadi, Mohamed
openaire   +3 more sources

On Intersection Problem for Perfect Binary Codes

Designs, Codes and Cryptography, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva   +2 more
openaire   +2 more sources

The Intersection Problem

1975
Abstract : This paper is intended as a supplement to AI MEMO 331, "A System for Representing and Using Real-World Knowledge". It is an attempt to redefine and clarify what I now believe the central theme of the research to be. Briefly, I will present the following points: 1.
openaire   +1 more source

The \(\mu\)-way intersection problem for cubes [PDF]

Australas. J Comb., 2001
A great deal of work has been done in the recent past on the intersection problem for combinatorial designs. The question addressed in this respect is: given two designs based on the same underlying set of elements, how many blocks may they have in common?
Adams, P., Bryant, D. E.
openaire   +2 more sources

The Mazur intersection problem

2006
Summary: Bounded closed convex sets in Euclidean space can be characterised by two distinct ball separation properties which in a general normed linear space are not equivalent. The study of these two separation properties has led to interesting developments in classifying those Banach spaces where these different characterisations of bounded closed ...
openaire   +1 more source

Geometric Intersection Problems

2018
We investigate a divide-and-conquer technique in multidimensional space which decomposes a geometric problem on N points in k dimensions into two problems on N/2 points in k dimensions plus a single problem on N points in k-1 dimension. Special structure of the subproblems is exploited to obtain an algorithm for finding the two closest of N points in O(
Bentley, John Louis, Shamos, Michael I.
openaire   +1 more source

A Problem of Complete Intersection

2004
Let X be a smooth irreducible closed subvariety of dimension ≥ 2 of the smooth irreducible algebraic variety P. Let Y be an effective Cartier divisor of X. In this chapter, roughly speaking, we want to study the following: Problem. Find conditions under which there exists a hypersurface H of P such that the scheme Y coincides with the scheme-theoretic ...
openaire   +1 more source

Intersection Problems

2002
Nicholas M. Patrikalakis, Takashi Maekawa   +1 more
openaire   +1 more source

The triangle intersection problem for S(2,4,v) designs

Discrete Mathematics, 2010
Yanxun Chang, Tao Feng, Giovanni Lo Faro   +2 more
exaly  

A new Lagrange solution to the privacy-preserving general geometric intersection problem

Journal of Network and Computer Applications, 2014
Huawei Zhao, Jiankun Hu
exaly