872 search results - page 67 / 175 » Extreme lower probabilities |
144
click to vote
JMLR
2006
15 years 4 months 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...
162
click to vote
TON
2008
15 years 4 months 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...
162
click to vote
INFOCOM
2010
IEEE
15 years 2 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...
125
click to vote
STOC
2001
ACM
16 years 4 months 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...
139
click to vote
ICC
2008
IEEE
15 years 11 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...