Sciweavers

4816 search results - page 367 / 964
» Performance analysis of the AntNet algorithm
Sort
View
CGO
2008
IEEE
16 years 1 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
179
Voted
HPDC
2010
IEEE
15 years 7 months ago
ParaText: scalable text modeling and analysis
Automated analysis of unstructured text documents (e.g., web pages, newswire articles, research publications, business reports) is a key capability for solving important problems ...
Daniel M. Dunlavy, Timothy M. Shead, Eric T. Stant...
SAC
2008
ACM
15 years 6 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
WWW
2004
ACM
16 years 7 months ago
Updating pagerank with iterative aggregation
We present an algorithm for updating the PageRank vector [1]. Due to the scale of the web, Google only updates its famous PageRank vector on a monthly basis. However, the Web chan...
Amy Nicole Langville, Carl Dean Meyer
170
Voted
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
16 years 1 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...