481 search results - page 33 / 97 » Learning relational probability trees |
CRYPTO
1999
Springer
13 years 12 months ago
1999
Springer
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
EMNLP
2007
13 years 9 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
In active learning, a machine learning algorithm is given an unlabeled set of examples U, and is allowed to request labels for a relatively small subset of U to use for training. ...
ECCC
2006
13 years 7 months ago
2006
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...