124 search results - page 10 / 25 » A generalization of weight polynomials to matroids |
NC
1998
14 years 11 months ago
1998
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
72
Voted
JUCS
2010
14 years 8 months ago
2010
: Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and whit...
MFCS
2010
Springer
14 years 7 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...