357 search results - page 10 / 72 » Analysis of Transposition-Table-Driven Work Scheduling in Di... |
100
click to vote
EDBT
2008
ACM
16 years 17 days ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
118
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
106
click to vote
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
121
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
121
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...