59 search results - page 10 / 12 » Odd Cycle Packing |
82
Voted
HPCA
2006
IEEE
16 years 1 days ago
2006
IEEE
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
100
click to vote
WWW
2008
ACM
16 years 11 days ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
CHI
2007
ACM
16 years 2 days ago
2007
ACM
How can we keep technology-focused computing and software engineering students interested and engaged in a soft subject like HCI? How can we avoid leaving the less gifted and less...
127
click to vote
CASES
2008
ACM
15 years 1 months ago
2008
ACM
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
108
click to vote
JCT
2008
14 years 11 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...