Sciweavers

5493 search results - page 306 / 1099
» Effectively Polynomial Simulations
Sort
View
SCL
2008
105views more  SCL 2008»
15 years 6 months ago
Computation of nonlinear balanced realization and model reduction based on Taylor series expansion
In this paper a computational algorithm for nonlinear balanced realization and model reduction based on Taylor series expansion is proposed. This algorithm requires recursive comp...
Kenji Fujimoto, Daisuke Tsubakino
TSMC
2002
69views more  TSMC 2002»
15 years 6 months ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
TCOM
2010
85views more  TCOM 2010»
15 years 1 months ago
Achieving the rate-distortion bound with low-density generator matrix codes
It is shown that binary low-density generator matrix codes can achieve the rate-distortion bound of discrete memoryless sources with general distortion measure via multilevel quant...
Zhibin Sun, Mingkai Shao, Jun Chen, Kon Max Wong, ...
ICASSP
2011
IEEE
14 years 10 months ago
The grouped two-sided orthogonal Procrustes problem
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
Bryan R. Conroy, Peter J. Ramadge
WSDM
2010
ACM
203views Data Mining» more  WSDM 2010»
16 years 4 months ago
Query Reformulation Using Anchor Text
Query reformulation techniques based on query logs have been studied as a method of capturing user intent and improving retrieval effectiveness. The evaluation of these techniques...
Van Dang, Bruce W. Croft