We propose a graph-based decomposition methodology of a network of document features represented by a terminology graph. The graph is automatically extracted from raw data based on Natural Language Processing techniques implemented in the TermWatch system. These graphs are Small Worlds. Based on clique minimal separators and the associated graph of atoms: a subgraph without clique separator, we...

This paper describes the fabrication of novel modified polyethylene (PE) membranes using plasma technology to create high-performance and cost-effective separator membranes for practical applications in lithium-ion polymer batteries. The modified PE membrane via plasma modification process plays a critical role in improving wettability and electrolyte retention, interfacial adhesion between sep...

In this report, we present the intersection graphs and describe the role they play in computations of treewidth. We introduce minimal triangulations, minimal separators, potential maximal cliques and blocks as the main tools for exact computation and approximation of that important graph parameter. The first chapter is an introduction to the intersection graph theory. We give all the necessary ...

A k-queue layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets such that no two edges that are in the same set are nested with respect to the vertex ordering. A k-track layout of a graph consists of a vertex kcolouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The queue-numbe...

We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is the number of minimal separators of the input graph. This yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs tha...

We introduce a new approach for designing computationally efficient learning algorithms that are tolerant to noise, and demonstrate its effectiveness by designing algorithms with improved noise tolerance guarantees for learning linear separators. We consider both the malicious noise model of Valiant [Valiant 1985; Kearns and Li 1988] and the adversarial label noise model of Kearns, Schapire, an...

break case catch class const continue default do else extends final finally for goto if implements import instanceof interface native new package private protected public return static super switch this throw throws try void while (Note that the primitive types are no longer considered keywords.) X10 introduces the following keywords: activitylocal async ateach atomic await clocked current fore...

In sparse Cholesky factorization, nding elimination orderings that produce small ll-in is very important and various heuristics have been proposed. For parallel computations, good orderings should produce elimination trees of low height. Finding optimal ll-in orderings and nding optimal height orderings are NP-hard problems. A class of Nested Dissection orderings with minimal separators, has be...

In this paper we describe a top-down approach to the segmentation and representation of documents containing tabular structures. Examples of these documents are invoices and technical papers with tables. The segmentation is based on an extension of X-Y trees, where the regions are split by means of cuts along separators (e.g. lines), in addition to cuts along white spaces. The leaves describe r...