Sciweavers

17 search results - page 2 / 4
» An Identification Scheme Based on Sparse Polynomials
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Acceleration of adaptive proximal forward-backward splitting method and its application to sparse system identification
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
Masao Yamagishi, Masahiro Yukawa, Isao Yamada
EUROCRYPT
2000
Springer
13 years 8 months ago
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
Daniel Bleichenbacher, Phong Q. Nguyen
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
13 years 4 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
EUROCRYPT
2004
Springer
13 years 10 months ago
Practical Large-Scale Distributed Key Generation
Generating a distributed key, where a constant fraction of the players can reconstruct the key, is an essential component of many largescale distributed computing tasks such as ful...
John F. Canny, Stephen Sorkin
TSP
2010
12 years 11 months ago
Distributed spectrum sensing for cognitive radio networks by exploiting sparsity
Abstract--A cooperative approach to the sensing task of wireless cognitive radio (CR) networks is introduced based on a basis expansion model of the power spectral density (PSD) ma...
Juan Andrés Bazerque, Georgios B. Giannakis