25 search results - page 3 / 5 » Optimal finger search trees in the pointer machine |
ML
2010
ACM
13 years 5 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...