1127 search results - page 153 / 226 » New Algorithms for Generalized Network Flows |
DIM
2009
ACM
15 years 5 months ago
2009
ACM
Reputation forms an important part of how we come to trust people in face-to-face interactions, and thus situations involving trust online have come to realize that reputation is ...
PODC
2003
ACM
15 years 4 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the ļ¬eld of ad-hoc rout...
117
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
SIGMETRICS
2011
ACM
14 years 1 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ļ¬...
INFOCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
āTraditional network routing uses the single (shortest) path paradigm. This paradigm exposes sessions to various attacks along this path, such as eavesdropping, DoS attacks etc. ...