Sciweavers

725 search results - page 114 / 145
» Bounding Degrees on RPL
Sort
View
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 4 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
SIGECOM
2009
ACM
102views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
On the price of mediation
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson...
PODC
2004
ACM
14 years 3 months ago
Gradient clock synchronization
We introduce the distributed gradient clock synchronization problem. As in traditional distributed clock synchronization, we consider a network of nodes equipped with hardware clo...
Rui Fan, Nancy A. Lynch
DAC
2003
ACM
14 years 3 months ago
Determining appropriate precisions for signals in fixed-point IIR filters
This paper presents an analytical framework for the implementation of digital infinite impulse response filters in fixed-point hardware on field programmable gate arrays. This ana...
Joan Carletta, Robert J. Veillette, Frederick W. K...
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh