Sciweavers

358 search results - page 25 / 72
» Sparse squares of polynomials
Sort
View
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
14 years 3 months ago
Computing correlated equilibria of polynomial games via adaptive discretization
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
NC
1998
101views Neural Networks» more  NC 1998»
13 years 10 months ago
Evolutionary Optimized Tensor Product Bernstein Polynomials versus Backpropagation Networks
In this paper a new approach for approximation problems involving only few input and output parameters is presented and compared to traditional Backpropagation Neural Networks (BP...
Günther R. Raidl, Gabriele Kodydek
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 4 months ago
Approximate Counting of Matchings in Sparse Hypergraphs
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 1 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
ICASSP
2011
IEEE
13 years 20 days ago
SSIM-inspired image denoising using sparse representations
Perceptual image quality assessment (IQA) and sparse signal representation have recently emerged as high-impact research topics in the field of image processing. Here we make one...
Abdul Rehman, Zhou Wang, Dominique Brunet, Edward ...