406 search results - page 11 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
110
click to vote
JMLR
2012
12 years 12 months ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...