2520 search results - page 206 / 504 » The complexity of approximating entropy |
141
click to vote
ICMCS
2006
IEEE
15 years 12 months ago
2006
IEEE
This paper proposes an algorithm for distributed classification, based on a SVM scheme. The contribution of each support vector is approximated by low complexity distributed thre...
152
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
132
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
169
click to vote
ICCAD
2010
IEEE
15 years 3 months ago
2010
IEEE
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
175
click to vote
NETWORKS
2011
15 years 25 days ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...