1542 search results - page 92 / 309 » Kernelization of packing problems |
101
click to vote
MST
2010
14 years 6 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
114
click to vote
AVSS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes to apply optimized One-Class Support Vector Machines (1-SVMs) as a discriminative framework in order to address a specific audio classification problem. Firs...
121
click to vote
ALGORITHMICA
2008
15 years 20 hour ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
ECCV
2000
Springer
16 years 1 months ago
2000
Springer
We formulate the problem of reconstructing the shape and radiance of a scene as the minimization of the information divergence between blurred images, and propose an algorithm that...
UAI
2004
15 years 1 months ago
2004
In this paper we define conditional random fields in reproducing kernel Hilbert spaces and show connections to Gaussian Process classification. More specifically, we prove decompo...