Results 251 to 260 of about 2,775,539 (295)

Performance Analyses of Cartesian Product Files and Random Files

open access: yesIEEE Transactions on Software Engineering, 1984
[[abstract]]In this paper, we shall derive two formulas for the average number of buckets to be examined over all possible partial match queries for Cartesian product files and random files, respectively.
R C T Lee
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Using Cartesian Product for Animation

The Journal of Visualization and Computer Animation, 2000
AbstractIn the field of geometric modelling for animation, 4D modelling (time being the fourth dimension) seems to be a natural extension of 3D modelling. But time dimension is not easy to apprehend and 4D objects are difficult to interpret and to control in general.
Xavier Skapin, Pascal Lienhardt
openaire   +4 more sources

Connectivity of Cartesian Product of Hypergraphs

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Na, Meng, Jixiang, Tian, Yingzhi
openaire   +2 more sources

A Note on Cartesian Products

American Journal of Mathematics, 1969
0. Introduction. Let as be an arc in the interior In of the n-cell In and let X be the quotient space I"/ac obtained by shrinking a to a point. According to Kwun and Raymond [4], X X 12 is an (n + 2)-cell. The crucial tool in their proof is the result of Andrews-Curtis that, under the above conditions, In/a X R1 is homeomorphic to In XR1.
openaire   +2 more sources

On the Discrepancy for Cartesian Products

Journal of the London Mathematical Society, 2000
We prove that the discrepancy for the family of Cartesian products \(B_1\times B_2\subseteq \mathbb{R}^4\), where \(B_1\) and \(B_2\) are circular discs in the plane, is \(O(n^{1/4+\varepsilon})\) for an arbitrarily small constant \(\varepsilon>0\), i.e. essentially the same as that for discs in the plane.
openaire   +2 more sources

Cartesian products of trees and paths

Journal of Graph Theory, 1996
Let all graphs be connected and simple, not necessarily finite. A subgraph \(F\) of \(G\) is called isometric if any two vertices of \(F\) have the same distance in \(G\) as in \(F\); and the interval \(I(x,y)\) consists of all vertices on the shortest paths between \(x\) and \(y\).
Hans-Jürgen Bandelt   +2 more
openaire   +3 more sources

The Cartesian Product

1970
When we say in analytic geometry that a point has co-ordinates (x, y), the order in which x and y occur, in the symbol (x, y), is important: (1, 2) ≠ (2, 1). For this reason we call (x, y) an ordered pair. Moreover, x and y come from sets; in this case x, y ∈ R. This idea can be generalizedf as follows. Let 𝒰 be a universe.
H. B. Griffiths, P. J. Hilton
openaire   +1 more source

On the skewness of Cartesian products with trees

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhangdong Ouyang   +2 more
openaire   +1 more source

Homogeneous Cartesian products

Australas. J Comb., 2002
Summary: A graph \(G\) is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of \(G\) extend to automorphisms of \(G\). We show that the only connected composite 1-homogeneous graphs are the cube, and \(K_n\times K_2\) and \(K_n\times K_n\) with \(n\geq 2\).
openaire   +2 more sources

On the Width of the Cartesian Product of Ordinals

Order
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Home - About - Disclaimer - Privacy