3055 search results - page 479 / 611 » Randomized Search Trees |
132
click to vote
NIPS
2004
15 years 5 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...
117
click to vote
SODA
2001
ACM
15 years 5 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 ...
137
click to vote
AAAI
2000
15 years 5 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 ...
138
click to vote
UAI
2003
15 years 5 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
125
click to vote
SODA
1996
ACM
15 years 5 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...