Sciweavers

1208 search results - page 80 / 242
» On Counting Generalized Colorings
Sort
View
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 9 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
JCT
2007
90views more  JCT 2007»
13 years 9 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
CORR
2004
Springer
88views Education» more  CORR 2004»
13 years 9 months ago
A Note on the PAC Bayesian Theorem
We prove general exponential moment inequalities for averages of [0,1]valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on t...
Andreas Maurer
IEEECSA
2009
13 years 6 months ago
Improved Query Plans for Unnesting Nested SQL Queries
- The SQL language allows users to express queries that have nested subqueries in them. Optimization of nested queries has received considerable attention over the last few years. ...
Pranav Khaitan, Satish Kumar M, Korra Sathya Babu,...
CCS
2004
ACM
14 years 2 months ago
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applic...
Adam J. O'Donnell, Harish Sethu