2924 search results - page 110 / 585 » Lower Bounds in Distributed Computing |
123
click to vote
MST
2011
14 years 7 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
116
Voted
EMSOFT
2005
Springer
15 years 6 months ago
2005
Springer
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
96
Voted
DATE
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider multiprocessor distributed real-time systems where concurrency control is managed using software transactional memory (or STM). For such a system, we propose an algori...
PODC
2005
ACM
15 years 6 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
99
Voted
PC
2000
15 years 12 days ago
2000
Rapid advancements in acoustical beamforming techniques for array signal processing are producing algorithms with increased levels of computational complexity. Concomitantly, auto...