Sciweavers

2983 search results - page 115 / 597
» The group marriage problem
Sort
View
203
Voted
ICNP
2002
IEEE
15 years 5 months ago
Distributed Collaborative Key Agreement Protocols for Dynamic Peer Groups
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
109
Voted
SIGCOMM
1998
ACM
15 years 5 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
DKE
2008
79views more  DKE 2008»
15 years 27 days ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
110
Voted
IJAC
2006
93views more  IJAC 2006»
15 years 24 days ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest
111
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach
— When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modi...
Wensheng Zhang, Guohong Cao