Sciweavers

325 search results - page 41 / 65
» An architecture and algorithms for multi-run clustering
Sort
View
IEEEPACT
2003
IEEE
15 years 11 months ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
DAC
2010
ACM
15 years 7 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
ICASSP
2009
IEEE
15 years 3 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz
CLUSTER
2002
IEEE
15 years 11 months ago
Scalable Resource Management in High Performance Computers
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...
INTENSIVE
2009
IEEE
16 years 24 days ago
Accelerating K-Means on the Graphics Processor via CUDA
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...
Mario Zechner, Michael Granitzer