Sciweavers

2996 search results - page 280 / 600
» Numberings and Randomness
Sort
View
ACSC
2006
IEEE
16 years 23 days ago
Throughput fairness in k-ary n-cube networks
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
Cruz Izu
IJCNN
2006
IEEE
16 years 22 days ago
Reducing Uncertainties in Neural Network Jacobians and Improving Accuracy of Neural Network Emulations with NN Ensemble Approach
—A new application of the NN ensemble technique to improve the accuracy and stability of the calculation of NN emulation Jacobians is presented. The term “emulation” is defin...
Vladimir M. Krasnopolsky
SAC
2005
ACM
16 years 8 days ago
SVD-based collaborative filtering with privacy
Collaborative filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. Such techniques recommend products to customers using similar users...
Huseyin Polat, Wenliang Du
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
16 years 7 days ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
COCOON
2005
Springer
16 years 7 days ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou