946 search results - page 10 / 190 » Maximizing data locality in distributed systems |
156
Voted
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
In distributed scenarios the robustness of a reputation mechanism depends on the data available for computation. Especially in ad-hoc networks the amount of available data is rest...
170
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
153
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
282
click to vote
NLP
2000
15 years 9 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
159
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...