2304 search results - page 76 / 461 » On the Vulnerability of Large Graphs |
NIPS
1998
15 years 1 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
185
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
194
click to vote
GIS
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— While the Internet continues to thrive, the resiliency of its fundamental routing infrastructure is not fully understood. In this paper, we analyze the behavior of the de facto...