537 search results - page 23 / 108 » A Call to Regularity |
DM
2006
13 years 7 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
IJCAT
2008
13 years 7 months ago
2008
: Component-Based Software Development (CBSD) and Aspect-Oriented Software Development (AOSD) are solutions to support software evolution by decomposing a software system into conc...
ALGORITHMICA
2002
13 years 7 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
NIPS
2004
13 years 9 months ago
2004
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...
DATE
2003
IEEE
14 years 28 days ago
2003
IEEE
In Networks on Chip, NoC, very low cost and high performance switches will be of critical importance. For a regular two-dimensional NoC we propose a very simple, memoryless switch...