1110 search results - page 123 / 222 » New Approximation Results for Resource Replication Problems |
CCR
2005
14 years 11 months ago
2005
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
99
Voted
STACS
2007
Springer
15 years 5 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
107
Voted
BROADNETS
2006
IEEE
15 years 5 months ago
2006
IEEE
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
TKDE
2010
14 years 9 months ago
2010
—With the popularity of voting systems in cyberspace, there are growing evidence that the current voting systems can be manipulated by fake votes. This problem has attracted many...
109
Voted
NIPS
2007
15 years 15 days ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...