1439 search results - page 52 / 288 » Fast approximation of centrality |
CANPC
1998
Springer
14 years 3 months ago
1998
Springer
In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
NIPS
2004
14 years 11 days ago
2004
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
This article provides a central limit theorem for a consistent estimator of the population eigenvalues of a class of sample covariance matrices. An exact expression as well as an ...
WINE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...