2560 search results - page 39 / 512 » Contributions to zero-sum problems |
IJHPCA
2010
13 years 6 months ago
2010
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
13 years 3 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...