Sciweavers

269 search results - page 52 / 54
» Complexity Theory Made Easy
Sort
View
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 8 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
JACM
2006
99views more  JACM 2006»
13 years 8 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
MST
2006
136views more  MST 2006»
13 years 8 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
PERVASIVE
2008
Springer
13 years 8 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
ALIFE
2005
13 years 8 months ago
State Aggregation and Population Dynamics in Linear Systems
We consider complex systems that are composed of many interacting elements, evolving under some dynamics. We are interested in characterizing the ways in which these elements may b...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright