699 search results - page 21 / 140 » Propagation of Mean Degrees |
CP
2011
Springer
12 years 7 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
SECURWARE
2008
IEEE
14 years 2 months ago
2008
IEEE
Email worms and the spam associated with them are one of the main operational security issues today because they waste time, money and resources. The high incidence of email worms...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
— Online Social Networks are communities of people who share common interests. These types of networks are used by millions of people around the world. The massive adoption of th...
NIPS
2008
13 years 9 months ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...