Sciweavers

4744 search results - page 816 / 949
» Connected Computing
Sort
View
ANCS
2010
ACM
15 years 4 months ago
Axon: a flexible substrate for source-routed ethernet
This paper introduces the Axon, an Ethernet-compatible device for creating large-scale datacenter networks. Axons are inexpensive, practical devices that are demonstrated using pr...
Jeffrey Shafer, Brent Stephens, Michael Foss, Scot...
181
Voted
PODC
2009
ACM
16 years 1 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...
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
15 years 11 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
ECML
2004
Springer
15 years 11 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier