Sciweavers

14774 search results - page 288 / 2955
» Computational complexity and evolutionary computation
Sort
View
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 5 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
FSTTCS
2010
Springer
15 years 4 months ago
Computing Rational Radical Sums in Uniform TC^0
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
ICASSP
2011
IEEE
14 years 10 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
AGI
2011
14 years 10 months ago
What Makes a Brain Smart? Reservoir Computing as an Approach for General Intelligence
Abstract. Recurrent connectivity, balanced between excitation and inhibition, is a general principle of cortical connectivity. We propose that balanced recurrence can be achieved b...
Janelle Szary, Bryan Kerster, Christopher T. Kello
ICIP
2003
IEEE
16 years 8 months ago
Fast Feldkamp algorithm for cone-beam computer tomography
We propose a new fast Feldkamp algorithm for 3-D cone beam tomography with a circular source trajectory. The algorithm is an extension of our recent fast native 2-D fan-beam recon...
Shu Xiao, Yoram Bresler, David C. Munson Jr.