1326 search results - page 198 / 266 » Approximate Tree Kernels |
139
Voted
ROBOCUP
2000
Springer
15 years 6 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
132
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
123
click to vote
NIPS
2004
15 years 4 months ago
2004
The NIPS 2003 workshops included a feature selection competition organized by the authors. We provided participants with five datasets from different application domains and calle...
165
Voted
PVLDB
2008
15 years 2 months ago
2008
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
137
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...