Sciweavers

1578 search results - page 131 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
PODC
2009
ACM
14 years 3 months ago
Fast scalable deterministic consensus for crash failures
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
AVI
2000
13 years 10 months ago
Generating User Interface Code in a Model Based User Interface Development Environment
Declarative models play an important role in most software design activities, by allowing designs to be constructed that selectively abstract over complex implementation details. ...
Paulo Pinheiro da Silva, Tony Griffiths, Norman W....
HPSR
2011
105views more  HPSR 2011»
12 years 8 months ago
Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA
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 ...
Guillermo Ibáñez, Bart De Schuymer, ...
ICML
2003
IEEE
14 years 9 months ago
Margin Distribution and Learning
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...
Ashutosh Garg, Dan Roth
SMI
2007
IEEE
129views Image Analysis» more  SMI 2007»
14 years 3 months ago
Localized Homology
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...
Afra Zomorodian, Gunnar Carlsson