1161 search results - page 81 / 233 » Kinetic Dependence Graphs |
126
Voted
DLOG
2011
14 years 4 months ago
2011
Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked da...
108
click to vote
VEE
2012
ACM
13 years 8 months ago
2012
ACM
Dynamic Binary Translators (DBT) and Dynamic Binary Optimization (DBO) by software are used widely for several reasons including performance, design simplification and virtualiza...
155
click to vote
ICPP
1996
IEEE
15 years 4 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
112
click to vote
JUCS
2006
15 years 16 days ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
131
Voted
ICALP
2009
Springer
16 years 26 days ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...