7930 search results - page 1460 / 1586 » Greedy in Approximation Algorithms |
136
click to vote
CGF
1999
15 years 3 months ago
1999
The display of images on binary output hardware requires a halftoning step. Conventional halftoning algorithms approximate image values independently from the image content and of...
152
click to vote
JAIR
1998
15 years 3 months ago
1998
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
129
click to vote
MP
2002
15 years 3 months ago
2002
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
134
click to vote
NN
2002
Springer
15 years 3 months ago
2002
Springer
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
124
click to vote
TIT
1998
15 years 3 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...