4781 search results - page 271 / 957 » Online algorithms for network design |
173
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
272
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
The application domain of intelligent transportation is plagued by a shortage of data sources that adequately assess traffic situations. Typically, to provide routing and navigati...
195
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We present a framework for automatically summarizing social group activity over time. The problem is important in understanding large scale online social networks, which have dive...
199
click to vote
UAI
2000
15 years 8 months ago
2000
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
194
click to vote
INFOSCALE
2006
ACM
16 years 21 days ago
2006
ACM
Cooperative caching is a very important technique for efficient data dissemination and sharing in mobile ad hoc networks (MANETs). Many applications have requirements on the consi...