![]() |
| 2003 | ||
|---|---|---|
| 2 | EE | Daniel Etzold: Heuristic to reduce the complexity of complete bipartite graphs to accelerate the search for maximum weighted matchings with small error CoRR cs.DS/0306123: (2003) |
| 1 | EE | Daniel Etzold: Improving spam filtering by combining Naive Bayes with simple k-nearest neighbor searches CoRR cs.LG/0312004: (2003) |