Sciweavers

2996 search results - page 302 / 600
» Numberings and Randomness
Sort
View
ISPA
2005
Springer
16 years 7 days ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
CORR
2011
Springer
199views Education» more  CORR 2011»
15 years 1 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
16 years 26 days ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
ISCAS
2003
IEEE
89views Hardware» more  ISCAS 2003»
16 years 10 hour ago
Timing-mismatch analysis in high-speed analog front-end with nonuniformly holding output
This paper will present a practical and complete analysis of timing-mismatch effects for high-speed Analog Front-End (AFE) systems with the inherent nonuniformly holding outputs. ...
Sai-Weng Sin, Seng-Pan U., Rui Paulo Martins, Jos&...
DAC
1995
ACM
15 years 10 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram