Results 1  10
of
440,946
List Partitions
 Proc. 31st Ann. ACM Symp. on Theory of Computing
, 2003
"... List partitions generalize list colourings and list homomorphisms. Each symmetric matrix M over 0; 1; defines a list partition problem. Different choices of the matrix M lead to many wellknown graph theoretic problems including the problem of recognizing split graphs and their generalizations, ..."
Abstract

Cited by 42 (14 self)
 Add to MetaCart
List partitions generalize list colourings and list homomorphisms. Each symmetric matrix M over 0; 1; defines a list partition problem. Different choices of the matrix M lead to many wellknown graph theoretic problems including the problem of recognizing split graphs and their generalizations
List Partitions and Trigraph Homomorphisms
, 2003
"... Abstract Trigraph homomorphisms are useful to model certain graph partition problems. We classify the complexity of all list homomorphisms to directed trigraphs with up to three vertices. ..."
Abstract
 Add to MetaCart
Abstract Trigraph homomorphisms are useful to model certain graph partition problems. We classify the complexity of all list homomorphisms to directed trigraphs with up to three vertices.
List Partitions and Trigraph Homomorphisms
, 2003
"... Abstract Trigraph homomorphisms are useful to model certain graph partition problems. We classify the complexity of all list homomorphisms to directed trigraphs with up to three vertices. ..."
Abstract
 Add to MetaCart
Abstract Trigraph homomorphisms are useful to model certain graph partition problems. We classify the complexity of all list homomorphisms to directed trigraphs with up to three vertices.
List Partitions of Chordal Graphs
"... In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and ` cliques. This is a naturalgeneralization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k < = 2 and ` < = 2. (Split graphshave k = ` = ..."
Abstract
 Add to MetaCart
become solvable in polynomial time for chordal graphs, even in the presence of lists. Onthe other hand, we show that there are Mpartition problems that remain NPcomplete even for chordal graphs. We also discuss forbidden subgraph characterizations for the existence of Mpartitions.
c ○ 2008 SCPE SINGLEPASS LIST PARTITIONING
"... Abstract. Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose length is unknown a priori. We can evenly divide it naïvely by either traversing it twice (first determine length ..."
Abstract
 Add to MetaCart
list partitioning algorithm is effective and fast in practice. Key words: parallel processing, sequences, algorithmic libraries 1. Introduction. An
A fast and high quality multilevel scheme for partitioning irregular graphs
 SIAM JOURNAL ON SCIENTIFIC COMPUTING
, 1998
"... Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc. ..."
Abstract

Cited by 1173 (16 self)
 Add to MetaCart
Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partition for the original graph [Bui and Jones, Proc.
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 430 (0 self)
 Add to MetaCart
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since
Limma: linear models for microarray data
 Bioinformatics and Computational Biology Solutions using R and Bioconductor
, 2005
"... This free opensource software implements academic research by the authors and coworkers. If you use it, please support the project by citing the appropriate journal articles listed in Section 2.1.Contents ..."
Abstract

Cited by 759 (13 self)
 Add to MetaCart
This free opensource software implements academic research by the authors and coworkers. If you use it, please support the project by citing the appropriate journal articles listed in Section 2.1.Contents
Mediators in the architecture of future information systems
 IEEE COMPUTER
, 1992
"... The installation of highspeed networks using optical fiber and high bandwidth messsage forwarding gateways is changing the physical capabilities of information systems. These capabilities must be complemented with corresponding software systems advances to obtain a real benefit. Without smart softw ..."
Abstract

Cited by 1128 (20 self)
 Add to MetaCart
level functional partitioning. These partitions are mapped into information processing modules. The modules are assigned to nodes of the distributed information systems. A central role is assigned to modules that mediate between the users ' workstations and data resources. Mediators contain
The Protection of Information in Computer Systems
, 1975
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sections ..."
Abstract

Cited by 815 (2 self)
 Add to MetaCart
architecture. It examines in depth the principles of modern protection architectures and the relation between capability systems and access control list systems, and ends with a brief analysis of protected subsystems and protected objects. The reader who is dismayed by either the prerequisites or the level
Results 1  10
of
440,946