403 search results - page 67 / 81 » Data Partitioning for Minimizing Transferred Data in MapRedu... |
147
Voted
ALGORITHMICA
2000
15 years 3 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
179
Voted
SPAA
2012
ACM
13 years 6 months ago
2012
ACM
GPU-based heterogeneous clusters continue to draw attention from vendors and HPC users due to their high energy efficiency and much improved single-node computational performance...
150
Voted
STACS
2007
Springer
15 years 10 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...
117
Voted
VTC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper deals with multiuser detection through base station cooperation in uplink interference limited scenarios. At high frequency reuse, each base station not only receive...
134
Voted
HYBRID
2010
Springer
15 years 10 months ago
2010
Springer
The main purpose of event-based control, if compared to periodic control, is to minimize data transfer or processing power in networked control systems. Current methods have an (i...