4007 search results - page 801 / 802 » Computation with imprecise probabilities |
KDD
2009
ACM
14 years 8 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...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
DRUMS
1998
Springer
13 years 11 months ago
1998
Springer
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...