4377 search results - page 471 / 876 » Mass problems and randomness |
180
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
186
click to vote
TCC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
170
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
174
click to vote
FOCS
2006
IEEE
16 years 29 days ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
157
click to vote
GLOBECOM
2006
IEEE
16 years 29 days ago
2006
IEEE
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...