Sciweavers

1173 search results - page 181 / 235
» On the Compositionality of Round Abstraction
Sort
View
RECOMB
2005
Springer
16 years 7 months ago
Very Low Power to Detect Asymmetric Divergence of Duplicated Genes
Abstract. Asymmetric functional divergence of paralogues is a key aspect of the traditional model of evolution following duplication. If one gene continues to perform the ancestral...
Cathal Seoighe, Konrad Scheffler
MOBIHOC
2008
ACM
16 years 6 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
IWSEC
2009
Springer
16 years 1 months ago
ID-Based Group Password-Authenticated Key Exchange
Abstract—Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this pa...
Xun Yi, Raylin Tso, Eiji Okamoto
FOCS
2007
IEEE
16 years 1 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor