1945 search results - page 158 / 389 » Pursuit-Evasion in Models of Complex Networks |
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
TACS
2001
Springer
14 years 23 days ago
2001
Springer
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
NIPS
2008
13 years 9 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...