Sciweavers

1272 search results - page 148 / 255
» The Set Cover with Pairs Problem
Sort
View
GLOBECOM
2007
IEEE
14 years 5 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
CRYPTO
2001
Springer
202views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
Revocation and Tracing Schemes for Stateless Receivers
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
Dalit Naor, Moni Naor, Jeffery Lotspiech
CISC
2005
Springer
169views Cryptology» more  CISC 2005»
14 years 4 months ago
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...
Serge Vaudenay
CP
2009
Springer
14 years 11 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
COCOON
2009
Springer
14 years 5 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura