Sciweavers

2612 search results - page 78 / 523
» Switching Graphs and Their Complexity
Sort
View
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 4 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao

Publication
151views
15 years 8 months ago
The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions
The OSU scheme is a rate-based congestion avoidance scheme for ATM networks using explicit rate indication. This work was one of the first attempts to define explicit rate switch m...
Raj Jain, Shiv Kalyanaraman and Ram Viswanathan
DATE
1998
IEEE
141views Hardware» more  DATE 1998»
14 years 2 months ago
Address Bus Encoding Techniques for System-Level Power Optimization
The power dissipated by system-level buses is the largest contribution to the global power of complex VLSI circuits. Therefore, the minimization of the switching activity at the I...
Luca Benini, Giovanni De Micheli, Donatella Sciuto...
FPL
2011
Springer
168views Hardware» more  FPL 2011»
12 years 9 months ago
Scalable Arbiters and Multiplexers for On-FGPA Interconnection Networks
Abstract—Soft on-FGPA interconnection networks are gaining increasing importance since they simplify the integration of heterogeneous components and offer, at the same time, a mo...
Giorgos Dimitrakopoulos, Christoforos Kachris, Emm...