854 search results - page 115 / 171 » Abstracting from Failure Probabilities |
173
click to vote
IPCO
2008
15 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
139
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candid...
147
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
125
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- Fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. ...
130
click to vote
JSAC
2006
15 years 4 months ago
2006
Abstract--In this paper, we present a novel code-aided joint synchronization and channel estimation algorithm for downlink multicarrier code-division multiple access. The expectati...