2542 search results - page 204 / 509 » Computing Cartograms with Optimal Complexity |
122
click to vote
IPTPS
2003
Springer
15 years 6 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
103
Voted
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
102
Voted
SIAMNUM
2011
14 years 7 months ago
2011
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
117
click to vote
SAGA
2009
Springer
15 years 7 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
101
click to vote
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Cancer chemotherapy is a complex treatment mode that requires balancing the benefits of treating tumours using anti-cancer drugs with the adverse toxic side-effects caused by these...