2434 search results - page 263 / 487 » Algorithmic Randomness of Closed Sets |
139
click to vote
UAI
2003
15 years 5 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
158
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
126
click to vote
DAM
2007
15 years 4 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
167
click to vote
TAL
2010
Springer
15 years 2 months ago
2010
Springer
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
142
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we present the classification sub-system of a real-time video-based face identification system which recognizes people entering through the door of a laboratory. Si...