Sciweavers

467 search results - page 15 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
FUIN
2006
93views more  FUIN 2006»
14 years 11 months ago
Membrane Computing and Economics: Numerical P Systems
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...
Gheorghe Paun, Radu A. Paun
TSP
2010
14 years 6 months ago
Doubly selective channel estimation using exponential basis models and subblock tracking
Three versions of a novel adaptive channel estimation approach, exploiting the over-sampled complex exponential basis expansion model (CE-BEM), is presented fordoubly selectivechan...
Jitendra K. Tugnait, Shuangchi He, Hyosung Kim
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
EJC
2008
14 years 11 months ago
Enumeration of almost polynomial rational functions with given critical values
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
Dmitri Panov, Dimitri Zvonkine
ICIP
2002
IEEE
16 years 1 months ago
Satellite and aerial image deconvolution using an EM method with complex wavelets
In this paper, we present a new deconvolution method, able to deal with noninvertible blurring functions. To avoid noise amplification, a prior model of the image to be reconstruc...
André Jalobeanu, Josiane Zerubia, Má...