17541 search results - page 370 / 3509 » Complexity in scalable computing |
195
click to vote
ERSA
2007
15 years 6 months ago
2007
Abstract: If the computational demands of an interactive graphics rendering application cannot be met by a single commodity Graphics Processing Unit (GPU), multiple graphics accele...
165
click to vote
ERSA
2006
15 years 6 months ago
2006
Abstract-- With the constantly increasing gate capacity of FPGAs, a single FPGA chip is able to employ large-scale applications. To connect a large number of computational nodes, N...
118
click to vote
VCIP
2003
15 years 6 months ago
2003
A new set of boundary-handling algorithms has been developed for discrete wavelet transforms in the ISO/IEC JPEG-2000 Still Image Coding Standard. Two polyphase component extrapol...
163
click to vote
C3S2E
2010
ACM
15 years 6 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
133
click to vote
SIGCOMM
2010
ACM
15 years 5 months ago
2010
ACM
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...