821 search results - page 124 / 165 » Time Dependent Processing in a Parallel Pipeline Architectur... |
IWMM
2009
Springer
15 years 4 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
EUROPAR
2000
Springer
15 years 1 months ago
2000
Springer
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
117
click to vote
DCOSS
2008
Springer
14 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
CIMCA
2005
IEEE
15 years 3 months ago
2005
IEEE
Owing to the increase in both heterogeneity and complexity in today’s networking systems, the need arises for an architecture for network-based services that provides flexibilit...
TC
2010
14 years 8 months ago
2010
—The most pervasive compute operation carried out in almost all bioinformatics applications is pairwise sequence homology detection (or sequence alignment). Due to exponentially ...