Sciweavers

534 search results - page 81 / 107
» Efficient polynomial L-approximations
Sort
View
TPDS
2008
72views more  TPDS 2008»
13 years 7 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert
INFORMATICALT
2000
93views more  INFORMATICALT 2000»
13 years 7 months ago
A Secure Nonrepudiable Threshold Proxy Signature Scheme with Known Signers
In the (t, n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficie...
Min-Shiang Hwang, Iuon-Chang Lin, Eric Jui-Lin Lu
IJCES
2002
100views more  IJCES 2002»
13 years 7 months ago
Neural Network Decoders for Linear Block Codes
This paper presents a class of neural networks suitable for the application of decoding error-correcting codes.The neural model is basically a perceptron with a high-order polynom...
Ja-Ling Wu, Yuen-Hsien Tseng, Yuh-Ming Huang
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 7 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
TIT
2002
121views more  TIT 2002»
13 years 7 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...