Sciweavers

1513 search results - page 1 / 303
» Fibonacci Correction Networks
Sort
View
SWAT
2000
Springer
111views Algorithms» more  SWAT 2000»
13 years 9 months ago
Fibonacci Correction Networks
Grzegorz Stachowiak
APCSAC
2005
IEEE
13 years 11 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
DC
2010
13 years 5 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
ICDCSW
2003
IEEE
13 years 10 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
13 years 10 months ago
Lower Bounds on Correction Networks
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
Grzegorz Stachowiak