10 search results - page 2 / 2 » Independent sets in Steiner triple systems |
JCT
2008
13 years 4 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
SIAMDM
2008
13 years 4 months ago
2008
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
ERSA
2007
13 years 6 months ago
2007
This paper describes a proof-of-concept implementation of a basic autonomous computing system. The system consists of an XUP Virtex-II Pro board running Linux and a set of softwar...
SEMWEB
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
OTM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We discuss our DLDB knowledge base system and evaluate its capability in processing a very large set of real-world Semantic Web data. Using DLDB, we have constructed the ...