1258 search results - page 70 / 252 » Architecture-driven Problem Decomposition |
IWOCA
2009
Springer
14 years 1 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
CICLING
2004
Springer
14 years 28 days ago
2004
Springer
The compound nouns are freely composed in Korean, since it is possible to concatenate independent nouns without a postposition. Therefore, the systems that handle compound nouns su...
SYRCODIS
2007
13 years 10 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...