Sciweavers

197 search results - page 39 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
JOIN
2007
96views more  JOIN 2007»
13 years 5 months ago
Universal Routing and Performance Assurance for Distributed Networks
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
Kevin F. Chen, Edwin Hsing-Mean Sha
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
WWW
2009
ACM
14 years 6 months ago
An experimental study of large-scale mobile social network
Mobile social network is a typical social network where one or more individuals of similar interests or commonalities, conversing and connecting with one another using the mobile ...
Zheng-Bin Dong, Guo-Jie Song, Kun-Qing Xie, Jing-Y...
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
14 years 6 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
SOFTVIS
2003
ACM
13 years 11 months ago
Nice Class Diagrams Admit Good Design?
Analysis and design of programs by using tools has emerged to a standard technique in object-oriented software engineering. Many of these tools claim to implement methods accordin...
Holger Eichelberger