Sciweavers

2299 search results - page 7 / 460
» A Class of Hypercube-Like Networks
Sort
View
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
13 years 7 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
ICANN
2007
Springer
14 years 1 months ago
Incremental One-Class Learning with Bounded Computational Complexity
Rowland R. Sillito, Robert B. Fisher
SBRN
2006
IEEE
14 years 1 months ago
Some typical classes of t-norms and the 1-Lipschitz Condition
Benjamín René Callejas Bedregal, Iva...
NETWORKS
2008
13 years 7 months ago
The number of spanning trees in a class of double fixed-step loop networks
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
COMCOM
2002
79views more  COMCOM 2002»
13 years 7 months ago
A probabilistic priority scheduling discipline for multi-service networks
This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is ...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko