Sciweavers

3206 search results - page 184 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 10 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
IEEEPACT
2000
IEEE
15 years 7 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
BCB
2010
213views Bioinformatics» more  BCB 2010»
14 years 10 months ago
Markov clustering of protein interaction networks with improved balance and scalability
Markov Clustering (MCL) is a popular algorithm for clustering networks in bioinformatics such as protein-protein interaction networks and protein similarity networks. An important...
Venu Satuluri, Srinivasan Parthasarathy, Duygu Uca...
DAMON
2007
Springer
15 years 9 months ago
Pipelined hash-join on multithreaded architectures
Multi-core and multithreaded processors present both opportunities and challenges in the design of database query processing algorithms. Previous work has shown the potential for ...
Philip Garcia, Henry F. Korth
136
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff