3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LG2003★ 3 cited
Improving spam filtering by combining Naive Bayes with simple k-nearest neighbor searches
Daniel Etzold
Using naive Bayes for email classification has become very popular within the last few months. They are quite easy to implement and very efficient. In this paper we want to present…
cs.DS2003
Heuristic to reduce the complexity of complete bipartite graphs to accelerate the search for maximum weighted matchings with small error
Daniel Etzold
A maximum weighted matching for bipartite graphs can be found by using the algorithm of Edmonds and Karp with a Fibonacci Heap and a modified Dijkstra in $O(nm + n…