Results 1 
6 of
6
Existentially closed BIBD blockintersection graphs
 ELECTRON J. COMBIN
, 2007
"... A graph G with vertex set V is said to be nexistentially closed if, for every S ⊂ V with S  = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T. Given a combinatorial design D with block set B, its blockintersect ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
A graph G with vertex set V is said to be nexistentially closed if, for every S ⊂ V with S  = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T. Given a combinatorial design D with block set B, its block
Properties of the Steiner triple systems of order 19
, 2010
"... Properties of the 11 084 874 829 Steiner triple systems of order 19 are examined. In particular, there is exactly one 5sparse, but no 6sparse, STS(19); there is exactly one uniform STS(19); there are exactly two STS(19) with no almost parallel classes; all STS(19) have chromatic number 3; all have ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Properties of the 11 084 874 829 Steiner triple systems of order 19 are examined. In particular, there is exactly one 5sparse, but no 6sparse, STS(19); there is exactly one uniform STS(19); there are exactly two STS(19) with no almost parallel classes; all STS(19) have chromatic number 3; all
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
of their reflections (i.e. approximations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for discussions and advice. I would like to thank Arnaud Durand and Patrice Ossona de Mendez for accepting to review this thesis and for their constructive comments on the earlier versions of this manuscript. Many thanks to Nicole Bidoit and Victor Vianu for accepting to be in my jury. Special thanks go to my Parents, who directed me to follow the scientific path and where fully supportive at all times. Thanks to all the members of LSV – it was a pleasure working with You. I would like to thank the awesome people whom I have been working with in the same office on the 4th floor. Without all the nice riddles and the magnificent French lessons my time there wouldn’t be as chouette as it was. Big thanks go to my son Boris, who was kind enough to sleep through the whole nights, allowing his dad to actually write the thesis down.