Showing items related by title, author, creator and subject.

• Algorithms For Efficient Implementation Of Secure Group Communication Systems 

  Rahul, S (2007-10-23)

  A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified ...

• An Algorithmic Approach To Crystallographic Coxeter Groups 

  Malik, Amita (2013-02-14)

  Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. It turns out that the finite Coxeter groups are precisely the finite Euclidean reflection ...

• Finding A Subset Of Non-defective Items From A Large Population : Fundamental Limits And Efficient Algorithms 

  Sharma, Abhay (2017-07-12)

  Consider a large population containing a small number of defective items. A commonly encountered goal is to identify the defective items, for example, to isolate them. In the classical non-adaptive group testing (NAGT) ...