446 search results - page 41 / 90 » Learning discrete categorial grammars from structures |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
ACMIDC
2010
13 years 11 months ago
2010
Stories play an important role in the collaborative project work of children and adults in intercultural computer clubs “come_IN”. They constitute the narrative framework for ...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
With the development of highly efficient graph data collection technology in many application fields, classification of graph data emerges as an important topic in the data mining...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...