1578 search results - page 131 / 316 » Direct Routing: Algorithms and Complexity |
132
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
238
Voted
AVI
2000
15 years 5 months ago
2000
Declarative models play an important role in most software design activities, by allowing designs to be constructed that selectively abstract over complex implementation details. ...
150
Voted
HPSR
2011
14 years 3 months ago
2011
Abstract—This paper describes the implementation of ARPPath (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA ...
102
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
109
Voted
SMI
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...