Jasintha quadras (4 risultati)

- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 51,00
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Embeddings and Interconnection Networks | A Study of the Dilation, Congestion and Congestion-sum Problems of Graph Embeddings | Jasintha Quadras (u. a.) | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783848424870 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengerich…er Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Come nuovo
EUR 138,43
EUR 28,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 49,26
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Quadras JasinthaDr. Sr. Jasintha Quadras, fmm, Principal, Stella Maris College, Chennai, India, holds a Doctorate in Mathematics, a PG Diploma in Computer Applications and an MS in Computer Science her… specialization is Graph Theor.

- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 59,71
EUR 61,22 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Embeddings of graphs have important applications in Computer Science and are of particular interest in the area of interconnection networks. Dr. Sr. Jasintha s work is a ground-breaking study in embedding techniques. The secret lies in…creating the ability to estimate the congestion-sum of embedding different architectures. Sr. Jasintha works with a paradigm of graphs that includes cycles, wheels, generalized wheels, a class of caterpillars, hypercubes, and Petersen graphs as guest graphs and trees as host graphs; and she demonstrates a novel technique of computing the dilation-sum of graph embeddings. Highly commended as a doctoral thesis, the prominent feature of Dr. Sr. Jasintha s study is that all the embeddings considered are elegant and they produce optimal congestion-sum in linear time. This opens up a world of possibilities for computer applications in network architecture. This study has inspired several other theses in the field of networking both internationally and at home.