1957 search results - page 214 / 392 » Approximate algorithms for neural-Bayesian approaches |
153
click to vote
JCT
2007
15 years 6 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
134
Voted
TSP
2008
15 years 6 months ago
2008
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
182
Voted
TSP
2008
15 years 6 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
148
click to vote
ORL
1998
15 years 5 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
138
click to vote
INTERSPEECH
2010
15 years 28 days ago
2010
In this paper, we propose to improve our previously developed method for joint compensation of additive and convolutive distortions (JAC) applied to model adaptation. The improvem...