3267 search results - page 60 / 654 » Generalized quasirandom graphs |
110
click to vote
DISOPT
2010
14 years 11 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
JCT
2010
14 years 9 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— Retiming, c-slow retiming and recycling are different transformations for the performance optimization of sequential circuits. For retiming and c-slow retiming, differe...
95
Voted
ICANN
2009
Springer
15 years 3 months ago
2009
Springer
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
75
Voted
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...