4324 search results - page 106 / 865 » A Generalized Representer Theorem |
117
click to vote
MM
2004
ACM
15 years 9 months ago
2004
ACM
Data adaptation is an essential system component in a wide variety of application areas. To date, most applications use ad hoc methods to manage data in response to limited resour...
140
click to vote
FLAIRS
2006
15 years 5 months ago
2006
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
126
click to vote
TAPD
1998
15 years 5 months ago
1998
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
118
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
135
click to vote
DM
2010
15 years 4 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...