Sciweavers

5451 search results - page 238 / 1091
» On very high degrees
Sort
View
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 11 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
DEXAW
1999
IEEE
129views Database» more  DEXAW 1999»
15 years 11 months ago
The Challenges of Requirements Engineering in Mobile Telephones Industry
Requirements engineering ranks as one of the most difficult and error-prone phases in the life cycle of devices such as mobile telephones. It is of critical importance because of ...
Alessandro Maccari
ISCOPE
1999
Springer
15 years 11 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
HCW
1998
IEEE
15 years 11 months ago
CCS Resource Management in Networked HPC Systems
CCS is a resource management system for parallel high-performance computers. At the user level, CCS provides vendor-independent access to parallel systems. At the system administr...
Axel Keller, Alexander Reinefeld
IPPS
1997
IEEE
15 years 11 months ago
Modeling Compiled Communication Costs in Multiplexed Optical Networks
Improvements in optical technology will enable the constructionof high bandwidth, low latencyswitching networks. These networks have many applications in massively parallel proces...
Charles A. Salisbury, Rami G. Melhem