Sciweavers

507 search results - page 22 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
DAC
2010
ACM
13 years 8 months ago
Toward efficient large-scale performance modeling of integrated circuits via multi-mode/multi-corner sparse regression
In this paper, we propose a novel multi-mode/multi-corner sparse regression (MSR) algorithm to build large-scale performance models of integrated circuits at multiple working mode...
Wangyang Zhang, Tsung-Hao Chen, Ming Yuan Ting, Xi...
JCP
2007
104views more  JCP 2007»
13 years 7 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
Abraham H. Diaz-Perez, Domingo Rodríguez
TIP
2010
141views more  TIP 2010»
13 years 2 months ago
Efficient Particle Filtering via Sparse Kernel Density Estimation
Particle filters (PFs) are Bayesian filters capable of modeling nonlinear, non-Gaussian, and nonstationary dynamical systems. Recent research in PFs has investigated ways to approp...
Amit Banerjee, Philippe Burlina
ICASSP
2010
IEEE
13 years 8 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
CIE
2009
Springer
14 years 2 months ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich