6110 search results - page 45 / 1222 » Approximate Computing |
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
115
click to vote
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
NN
2000
Springer
14 years 9 months ago
2000
Springer
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
SOFTWARE
2002
14 years 9 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
STACS
2009
Springer
15 years 4 months ago
2009
Springer