Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with kernel-functions
Search options answers only
not deleted
user 80547
Questions about the similarity functions used in machine learning to compare inputs in implicit higher-dimensional feature spaces.
1
vote
Accepted
Vertex deletion to perfect matching
I'm not sure about the FPT algorithm, but I have an idea for the kernelization.
All vertices with degree > k + 1 must be in X, since otherwise you would have to pick all but one of its neighbours whi …
- 26