Sciweavers

3206 search results - page 305 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
LCPC
2004
Springer
15 years 8 months ago
HiLO: High Level Optimization of FFTs
As computing platforms become more and more complex, the task of optimizing performance critical codes becomes more challenging. Recently, more attention has been focused on automa...
Nick Rizzolo, David A. Padua
ISCA
2005
IEEE
98views Hardware» more  ISCA 2005»
15 years 9 months ago
Techniques for Efficient Processing in Runahead Execution Engines
Runahead execution is a technique that improves processor performance by pre-executing the running application instead of stalling the processor when a long-latency cache miss occ...
Onur Mutlu, Hyesoon Kim, Yale N. Patt
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 10 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
15 years 1 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
ICIP
2004
IEEE
16 years 4 months ago
Rate-distortion optimized streaming of video with multiple independent encodings
We extend recent work on rate-distortion optimized streaming of video to include the case when multiple, independently encoded and packetized versions of the video are available f...
Mark Kalman, Bernd Girod