241 search results - page 44 / 49 » Thread Partitioning and Scheduling Based on Cost Model |
VLDB
2006
ACM
14 years 7 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
STACS
2007
Springer
14 years 1 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...
IPSN
2005
Springer
14 years 26 days ago
2005
Springer
— In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of...
CLOUD
2010
ACM
14 years 13 days ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
RTCSA
2000
IEEE
13 years 11 months ago
2000
IEEE
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and...