7228 search results - page 513 / 1446 » From Algorithmic to Subjective Randomness |
176
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
218
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
160
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
182
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
157
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
Binary segmentation, a problem of extracting foreground objects from the background, often arises in medical imaging and document processing. Popular existing solutions include Ex...