520 search results - page 88 / 104 » Subset Counting in Trees |
ICDCIT
2004
Springer
14 years 1 months ago
2004
Springer
We focus on the problem of distributing key updates in secure dynamic groups. Due to changes in group membership, the group controller needs to change and distribute the keys used...
IWPC
2003
IEEE
14 years 1 months ago
2003
IEEE
Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly i...
CCS
2003
ACM
14 years 1 months ago
2003
ACM
We propose the use of “selective blocking” by “blocker tags” as a way of protecting consumers from unwanted scanning of RFID tags attached to items they may be carrying or...
FSTTCS
2003
Springer
14 years 29 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
ICALP
2010
Springer
14 years 16 days ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...