1060 search results - page 188 / 212 » On the Discovery of Random Trees |
NIPS
2007
14 years 11 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
NIPS
2004
14 years 11 months ago
2004
The NIPS 2003 workshops included a feature selection competition organized by the authors. We provided participants with five datasets from different application domains and calle...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
UAI
2004
14 years 11 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
AAAI
2000
14 years 11 months ago
2000
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...