Sciweavers

414 search results - page 8 / 83
» On discrete norms of polynomials
Sort
View
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
14 years 4 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...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 9 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy
DCC
2002
IEEE
14 years 9 months ago
Polynomial Interpolation of the Discrete Logarithm
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
Arne Winterhof
ICASSP
2011
IEEE
13 years 1 months ago
Smoothing fir filtering of discrete state-space polynomial signal models
A smoothing finite impulse response (FIR) filter is addressed for discrete time-invariant state-space polynomial models commonly used to model signals over finite data. A gener...
Oscar Gerardo Ibarra-Manzano, Yuriy S. Shmaliy, Lu...
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani