2127 search results - page 310 / 426 » Computing large matchings fast |
132
click to vote
BROADNETS
2006
IEEE
15 years 10 months ago
2006
IEEE
— The nature of Grid and distributed computing implies communication between heterogeneous systems over a wide and ever-changing variety of network environments. Often large amou...
134
click to vote
GLVLSI
2005
IEEE
15 years 9 months ago
2005
IEEE
A hierarchical scheme with cells and modules is crucial for managing design complexity during a large integrated circuit design. We present a methodology for thermal aware cell-ba...
137
click to vote
ISCC
2005
IEEE
15 years 9 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
139
click to vote
ANTS
2004
Springer
15 years 9 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
136
click to vote
PG
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a novel approach for adaptively grouping and subdividing hair using discrete level-of-detail (LOD) representations. The set of discrete LODs include hair strands, clust...