Sciweavers

1404 search results - page 190 / 281
» On General Laws of Complex Networks
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 5 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
COMCOM
2006
103views more  COMCOM 2006»
15 years 4 months ago
Research challenges in QoS routing
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities ...
Xavier Masip-Bruin, Marcelo Yannuzzi, Jordi Doming...
ANCS
2008
ACM
15 years 6 months ago
Implementing an OpenFlow switch on the NetFPGA platform
We describe the implementation of an OpenFlow Switch on the NetFPGA platform. OpenFlow is a way to deploy experimental or new protocols in networks that carry production traffic. ...
Jad Naous, David Erickson, G. Adam Covington, Guid...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 4 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
NOMS
2006
IEEE
189views Communications» more  NOMS 2006»
15 years 10 months ago
Analysis of Firewall Policy Rules Using Data Mining Techniques
— Firewall is the de facto core technology of today's network security and defense. However, the management of firewall rules has been proven to be complex, error-prone, cos...
Korosh Golnabi, Richard K. Min, Latifur Khan, Ehab...