Sciweavers

8125 search results - page 1191 / 1625
» Parallelism and evolutionary algorithms
Sort
View
EOR
2008
93views more  EOR 2008»
15 years 6 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
JSAC
1998
126views more  JSAC 1998»
15 years 6 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
162
Voted
TCAD
1998
96views more  TCAD 1998»
15 years 6 months ago
Diagnosis of clustered faults and wafer testing
—A probabilistic diagnosis algorithm is presented for constant degree structures. The performance of the algorithm is analyzed under a negative binomial failure distribution to a...
Kaiyuan Huang, Vinod K. Agarwal, Krishnaiyan Thula...
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 5 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
CIARP
2009
Springer
15 years 4 months ago
Incorporating Linguistic Information to Statistical Word-Level Alignment
Abstract. Parallel texts are enriched by alignment algorithms, thus establishing a relationship between the structures of the implied languages. Depending on the alignment level, t...
Eduardo Cendejas, Grettel Barceló, Alexande...
« Prev « First page 1191 / 1625 Last » Next »