Sciweavers

2127 search results - page 250 / 426
» Computing large matchings fast
Sort
View
131
Voted
IPPS
2006
IEEE
15 years 10 months ago
Architecture of a multi-context FPGA using a hybrid multiple-valued/binary context switching signal
Multi-context FPGAs have multiple memory bits per configuration bit forming configuration planes for fast switching between contexts. Large amount of memory causes significant ove...
Yoshihiro Nakatani, Masanori Hariyama, Michitaka K...
DEXAW
2003
IEEE
164views Database» more  DEXAW 2003»
15 years 9 months ago
Towards an Open Service Architecture for Data Mining on the Grid
Across a wide variety of fields, huge datasets are being collected and accumulated at a dramatical pace. The datasets addressed by individual applications are very often heteroge...
Peter Brezany, Jürgen Hofer, Alexander Wö...
IPPS
2003
IEEE
15 years 9 months ago
Short Vector Code Generation for the Discrete Fourier Transform
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
Franz Franchetti, Markus Püschel
ICCSA
2003
Springer
15 years 9 months ago
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environment (DVE) systems very common nowadays. However, there are...
Pedro Morillo, Marcos Fernández, Juan M. Or...
RT
2001
Springer
15 years 9 months ago
Real-Time Occlusion Culling with a Lazy Occlusion Grid
We present a new conservative image-based occlusion culling method to increase the speed of hardware accelerated rendering of very complex general scenes which may consist of mill...
Heinrich Hey, Robert F. Tobler, Werner Purgathofer