117 search results - page 13 / 24 » Anti-Sniffing in Unbounded Networks |
143
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
90
Voted
ECAI
2010
Springer
15 years 19 days ago
2010
Springer
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
DAC
2002
ACM
16 years 1 months ago
2002
ACM
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
98
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
101
Voted
WSOM
2009
Springer
15 years 7 months ago
2009
Springer
We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of...