Sciweavers

9949 search results - page 91 / 1990
» On the Network Complexity of Selection
Sort
View
COMSWARE
2007
IEEE
14 years 3 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
CRYPTO
2006
Springer
104views Cryptology» more  CRYPTO 2006»
14 years 19 days ago
Random Selection with an Adversarial Majority
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
Ronen Gradwohl, Salil P. Vadhan, David Zuckerman
ICALP
2009
Springer
14 years 9 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
CSC
2008
13 years 10 months ago
Eigenvalue Spectra Measurements of Complex Networks
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
Kenneth A. Hawick
TWC
2008
140views more  TWC 2008»
13 years 8 months ago
Low complexity and fractional coded cooperation for wireless networks
Wireless networks, and especially wireless sensor networks, have complexity and energy constraints, within which they must confront the challenging wireless fading environment. In ...
Andrew W. Eckford, Josephine P. K. Chu, Raviraj S....