Sciweavers

2766 search results - page 487 / 554
» Algorithms for trigonometric polynomials
Sort
View
CORR
2008
Springer
117views Education» more  CORR 2008»
14 years 10 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
IEEECIT
2010
IEEE
14 years 10 months ago
A Recognizer of Rational Trace Languages
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
Federico Maggi
INFOCOM
2010
IEEE
14 years 10 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
TFS
2008
129views more  TFS 2008»
14 years 10 months ago
A Functional-Link-Based Neurofuzzy Network for Nonlinear System Control
Abstract--This study presents a functional-link-based neurofuzzy network (FLNFN) structure for nonlinear system control. The proposed FLNFN model uses a functional link neural netw...
Cheng-Hung Chen, Cheng-Jian Lin, Chin-Teng Lin
JCO
2010
123views more  JCO 2010»
14 years 10 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher