7228 search results - page 248 / 1446 » From Algorithmic to Subjective Randomness |
115
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
133
click to vote
DAM
2008
15 years 4 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
156
click to vote
EOR
2006
15 years 4 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
161
click to vote
TEC
2008
15 years 4 months ago
2008
In general, the analysis of microarray data requires two steps: feature selection and classification. From a variety of feature selection methods and classifiers, it is difficult t...
236
click to vote
TIT
2008
15 years 4 months ago
2008
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 ...