1326 search results - page 157 / 266 » Approximate Tree Kernels |
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
Although a considerable amount of work has been published on material classification, relatively little of it studies situations with considerable variation within each class. Man...
DIS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
WG
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...