2084 search results - page 246 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
158
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
155
click to vote
ICPP
2007
IEEE
16 years 14 days ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
168
click to vote
SIAMSC
2010
15 years 4 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
177
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
185
Voted
WAW
2007
Springer
16 years 7 days ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...