Sciweavers

5523 search results - page 185 / 1105
» Improving application performance with hardware data structu...
Sort
View
127
Voted
ICNP
2007
IEEE
15 years 10 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
123
Voted
DATE
2006
IEEE
96views Hardware» more  DATE 2006»
15 years 9 months ago
Multi-sensor configurable platform for automotive applications
This paper presents a configurable and generic platform architecture suitable to interface several kinds of sensors for automotive applications. A platform-based design approach i...
L. Serafini, F. Carrai, T. Ramacciotti, V. Zolesi
171
Voted
CIKM
2010
Springer
15 years 2 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
128
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
139
Voted
PLDI
2003
ACM
15 years 9 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...