1503 search results - page 162 / 301 » Self-optimizing distributed trees |
121
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
130
Voted
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the pro...
122
Voted
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
141
Voted
COMPSAC
2002
IEEE
15 years 8 months ago
2002
IEEE
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
127
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...