A k-queue layout of a graph G consists of a linear order σ of V (G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ. This paper studies queue layouts of graph products and powers.

Harnessing the full performance potential of cache-coherent distributed shared memory multiprocessors without inordinate user effort requires a compilation technology that can automatically manage multiple levels of memory hierarchy. This paper describes a working compiler for such machines that automatically partitions loops and data arrays to optimize locality of access. The compiler implemen...

Since the hardware-software partitioning problem is a key aspect of the codesign of digital electronic systems, extensive researches have been performed with diverse definitions of partitioning problems. However, existent partitioning solutions are not applicable to many real applications partly because of restricted input specification or insufficient constraints. In this paper, we aim to iden...

Compared with the previous generation of High Efficiency Video Coding (HEVC), Versatile (VVC) introduces a quadtree and multi-type tree (QTMT) partition structure nested multi-class trees so that coding unit (CU) can better match video texture features. This makes compression efficiency VVC significantly improved, but computational complexity is also increased, resulting in an increase encoding...

There are many methods for numerical solutions of integral equations. In various branches of science and engineering, chemistry and biology, and physics applications integral equation is provided by many other authors. In this paper, a simple numerical method using a fuzzy, for the numerical solution of the integral equation with the weak singular kernel is provided. Finally, by providing three...

This paper describes PBSM (Partition Based Spatial–Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could arise if both inputs to the join are intermediate results in a complex query, or in a parallel environment where the inputs must be dynamicall...

The Bayesian approach to inference stands out for naturally allowing borrowing information across heterogeneous populations, with different samples possibly sharing the same distribution. A popular nonparametric model clustering probability distributions is nested Dirichlet process, which however has drawback of grouping in a single cluster when ties are observed samples. With goal achieving fl...

We develop an algorithm that is fast and scalable in the detection of a nested partition extracted from dendrogram obtained hierarchical clustering multivariate series. Our provides p-value for each clade observed tree. The by computing many bootstrap replicas dissimilarity matrix performing statistical test on difference between associated with given its parent node. prove efficacy our set ben...

In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a cells-and-portals partition, and introduce a two-pass algorithm that computes a cells-and-portals partition. The algorithm uses a simple heuristic that creates short portals as a mean for generating an effective partiti...

In this text, we present a generalisation of the idea of the Implicitly Restarted Arnoldi method to the nonsymmetric Lanczos algorithm, using the two-sided Gram-Schmidt process or using a full Lanczos tridi-agonalisation. The Implicitly Restarted Lanczos method can be combined with an implicit lter. It can also be used in case of breakdown and ooers an alternative for look-ahead.