6251 search results - page 321 / 1251 » Randomness, Computability, and Density |
168
click to vote
TMC
2010
15 years 5 months ago
2010
—Compromised-node and denial-of-service are two key attacks in wireless sensor networks (WSNs). In this paper, we study routing mechanisms that circumvent (bypass) black holes fo...
248
click to vote
CVPR
2011
IEEE
15 years 3 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...
290
click to vote
SJ
2011
15 years 1 months ago
2011
—In this paper, we study the resilience of supply networks against disruptions and provide insights to supply chain managers on how to construct a resilient supply network from t...
220
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
193
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...