51 search results - page 1 / 11 » On the complexity of computational problems regarding distri... |
ECCC
2011
12 years 12 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
SAC
2010
ACM
13 years 11 months ago
2010
ACM
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...
MIDDLEWARE
2007
Springer
13 years 11 months ago
2007
Springer
Integrating sensor networks with general purpose IT infrastructure has been confirmed as a complex problem in the development and management of industrial sensor applications. Th...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
SIAMMAX
2011
12 years 11 months ago
2011
Abstract. Ergodicity coefficients for stochastic matrices determine inclusion regions for subdominant eigenvalues; estimate the sensitivity of the stationary distribution to change...