Sciweavers

580 search results - page 97 / 116
» Choosing a random peer
Sort
View
TIT
2008
122views more  TIT 2008»
15 years 3 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
VLSISP
2008
106views more  VLSISP 2008»
15 years 3 months ago
Architecture Considerations for Multi-Format Programmable Video Processors
Many different video processor architectures exist. Its architecture gives a processor strength for a particular application. Hardwired logic yields the best performance/cost, but ...
Jonah Probell
CI
2004
116views more  CI 2004»
15 years 3 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
CLUSTER
2002
IEEE
15 years 3 months ago
Online Prediction of the Running Time of Tasks
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
Peter A. Dinda
PAMI
2002
108views more  PAMI 2002»
15 years 2 months ago
Approximate Bayes Factors for Image Segmentation: The Pseudolikelihood Information Criterion (PLIC)
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
Derek C. Stanford, Adrian E. Raftery