2252 search results - page 176 / 451 » Lower Bounds for Dynamic Algorithms |
148
click to vote
PODC
2006
ACM
16 years 9 days ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
147
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
160
click to vote
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
146
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
190
click to vote
IDA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...