Sciweavers

332 search results - page 25 / 67
» Hypercubic Sorting Networks
Sort
View
ISCAPDCS
2004
15 years 7 months ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu
ECIR
2006
Springer
15 years 7 months ago
Comparing Different Architectures for Query Routing in Peer-to-Peer Networks
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional "resourc...
Henrik Nottelmann, Norbert Fuhr
IWANN
2009
Springer
15 years 10 months ago
Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoidal Neural Networks
We propose a general method for estimating the distance between a compact subspace K of the space L1 ([0, 1]s ) of Lebesgue measurable functions defined on the hypercube [0, 1]s ,...
José Luis Montaña, Cruz E. Borges
SOFSEM
1997
Springer
15 years 10 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ICPP
2003
IEEE
15 years 11 months ago
A Priority-based Balanced Routing Scheme for Random Broadcasting and Routing in Tori
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
Chi-Hsiang Yeh, Emmanouel A. Varvarigos, Abdelhami...