777 search results - page 77 / 156 » A fast algorithm for the computation of an upper bound on th... |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
WEA
2004
Springer
14 years 1 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
DAGSTUHL
2007
13 years 9 months ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...