11345 search results - page 375 / 2269 » Foundations of Computer Science |
177
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
203
click to vote
MPC
2010
Springer
15 years 11 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
191
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
184
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link wit...
176
click to vote
JACM
2000
15 years 6 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...