Sciweavers

159 search results - page 17 / 32
» Analysis of One-Way Reservation Algorithms
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
13 years 10 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
PR
2006
65views more  PR 2006»
13 years 10 months ago
Why direct LDA is not equivalent to LDA
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...
Hui Gao, James W. Davis
IJON
2002
98views more  IJON 2002»
13 years 9 months ago
Blind deconvolution by simple adaptive activation function neuron
The `Bussgang' algorithm is one among the most known blind deconvolution techniques in the adaptive signal processing literature. It relies on a Bayesian estimator of the sou...
Simone Fiori
COMCOM
2004
117views more  COMCOM 2004»
13 years 10 months ago
Dynamic bandwidth allocation in multi-class connection-oriented networks
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
Samer Taha, Mohsen Kavehrad
IPM
2007
145views more  IPM 2007»
13 years 10 months ago
Text mining techniques for patent analysis
Patent documents contain important research results. However, they are lengthy and rich in technical terminology such that it takes a lot of human efforts for analyses. Automatic...
Yuen-Hsien Tseng, Chi-Jen Lin, Yu-I Lin