4007 search results - page 339 / 802 » Computation with imprecise probabilities |
154
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
175
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
250
click to vote
AI
2006
Springer
15 years 7 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
220
click to vote
CN
2006
15 years 7 months ago
2006
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
191
click to vote
COR
2006
15 years 7 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...