114 search results - page 16 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
DSMML
2004
Springer
15 years 2 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
NIPS
2008
14 years 10 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
104
click to vote
HPCC
2005
Springer
15 years 2 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...