522 search results - page 45 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
143
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
126
Voted
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
113
Voted
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
146
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
138
click to vote
ACSW
2006
15 years 5 months ago
2006
Today, a computer network is under constant assault from attacks. In Computer Science, NIDS are used in order to protect a computer network against these intrusions. These systems...