358 search results - page 23 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
129
click to vote
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
142
click to vote
DCC
1996
IEEE
15 years 6 months ago
1996
IEEE
We present here design techniques for trellis-coded vector quantizers with symmetric codebooks that facilitate lowcomplexity quantization as well as partitioning into equiprobable ...
126
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
157
click to vote
FPGA
2010
ACM
15 years 2 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
149
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...