160 search results - page 5 / 32 » Efficient Kernel-based Learning for Trees |
148
Voted
COLT
2010
Springer
15 years 19 days ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
130
Voted
BICOB
2010
Springer
15 years 19 days ago
2010
Springer
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...
119
Voted
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
135
Voted
AAAI
1998
15 years 4 months ago
1998
Reinforcement learning is an effective technique for learning action policies in discrete stochastic environments, but its efficiency can decay exponentially with the size of the ...
105
Voted
EDUTAINMENT
2006
Springer
2006
Springer
Efficiently Maintaining Consistency Using Tree-Based P2P Network System in Distributed Network Games
15 years 6 months ago
There are two main approaches, conservative and optimistic, for maintaining consistency in distributed network games. Under the conservative approach, players may experience netwo...