Sciweavers

7055 search results - page 1158 / 1411
» Some New 4-Designs
Sort
View
CONCUR
2009
Springer
16 years 1 months ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
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...
UC
2009
Springer
16 years 1 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong
AFRICACRYPT
2010
Springer
16 years 1 months ago
Flexible Group Key Exchange with On-demand Computation of Subgroup Keys
Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communica...
Michel Abdalla, Céline Chevalier, Mark Manu...
CISS
2008
IEEE
16 years 1 months ago
Network distribution capacity and content-pipe gap
Abstract— The growth of video content and diversification of content-sharing methods in the Internet lead to an exciting range of new problems in networking, communications, and...
Mung Chiang
« Prev « First page 1158 / 1411 Last » Next »