872 search results - page 67 / 175 » Extreme lower probabilities |
103
click to vote
JMLR
2006
15 years 16 days ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
123
Voted
TON
2008
15 years 14 days ago
2008
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
130
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—It is a well known fact that user-chosen passwords are somewhat predictable: by using tools such as dictionaries or probabilistic models, attackers and password recovery tools c...
88
Voted
STOC
2001
ACM
16 years 26 days ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
108
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In this paper, we analyze the performance of the Load-Level-Based Admission Control mechanism (LLAC) for optical burst-switched networks in a multilink scenario. The goal of th...