Sciweavers

2354 search results - page 278 / 471
» Randomness, Stochasticity and Approximations
Sort
View
WONS
2012
IEEE
14 years 1 months ago
Obfuscating IEEE 802.15.4 communication using secret spreading codes
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
DAM
2010
112views more  DAM 2010»
15 years 6 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 6 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
GLOBECOM
2007
IEEE
16 years 15 days ago
Evaluation of the Probability of K-Hop Connection in Homogeneous Wireless Sensor Networks
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
Xiaoyuan Ta, Guoqiang Mao, Brian D. O. Anderson
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
16 years 8 days ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson