Results 51 to 60 of about 6,290,196 (343)
The Sigma Coindex of Graph Operations
The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj +1 more source
Computing Join Queries with Functional Dependencies [PDF]
Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids.
Mahmoud Abo Khamis, H. Ngo, Dan Suciu
semanticscholar +1 more source
A New Framework for Join Product Skew
Different types of data skew can result in load imbalance in the context of parallel joins under the shared nothing architecture. We study one important type of skew, join product skew (JPS). A static approach based on frequency classes is proposed which
Afrati, Foto +3 more
core +1 more source
Product Pre-Launch Prediction From Resilient Distributed e-WOM Data
Pre-launch success prediction of a product is a challenge in today's electronic world. Based on this prediction, industries can avoid huge losses by deciding on whether to launch or not to launch a product into the market.
Sandhya Narayanan +2 more
doaj +1 more source
Fool’s solitaire on joins and Cartesian products of graphs
Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump.
Jennifer Wise, Sarah Loeb
openaire +3 more sources
Linear Systems over Join-Blank Algebras [PDF]
A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible.
Jananthan, Hayden +2 more
core +2 more sources
On polyhedral product spaces over polyhedral joins [PDF]
The construction of a simplicial complex given by polyhedral joins (introduced by Anton Ayzenberg), generalizes Bahri, Bendersky, Cohen and Gitler's $J$-construction and simplicial wedge construction. This article gives a cohomological decomposition of a polyhedral product over a polyhedral join for certain families of pairs of simplicial complexes.
openaire +3 more sources
CAT(0) spaces with boundary the join of two Cantor sets
We will show that if a proper complete CAT(0) space X has a visual boundary homeomorphic to the join of two Cantor sets, and X admits a geometric group action by a group containing a subgroup isomorphic to Z^2, then its Tits boundary is the spherical ...
Bridson +3 more
core +1 more source
Please join me in thanking Diane for her service to ACL and for the product she has so ably assisted in bringing to the Association 3 times a year for almost a ...
Powell, Anne-Elizabeth
core +1 more source
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source

