Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Venka PALANIAPPAN"'
Publikováno v:
Pamukkale University Journal of Engineering Sciences, Vol 16, Iss 3, Pp 235-245 (2010)
Kaynak dil her ne olursa olsun metin dosyaları, kayda değer miktarda tekrar (fazlalık) içerebilmektedir. Veri sıkıştırma, bu fazlalığı kullanarak ileti etkinliğini artırmayı ve bilgi depolama masrafını azaltmayı amaçlar. Geleneksel
Externí odkaz:
https://doaj.org/article/6bd5ee60086c46718a5d5f93dba2c346
Publikováno v:
Pamukkale University Journal of Engineering Sciences, Vol 16, Iss 3, Pp 235-245 (2010)
Regardless of the source language, text documents contain significant amount of redundancy. Data compression exploits this redundancy to improve transmission efficiency and/or save storage space. Conventionally, various lossless text compression algo
Externí odkaz:
https://doaj.org/article/8d0cdea7ddf14f3493c2d3e1d6a61fa4
Autor:
Venka Palaniappan, Shahram Latifi
Publikováno v:
AINA
The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0edb507906f23ae7eee634b530d7159
https://doi.org/10.1109/aina.2007.135
https://doi.org/10.1109/aina.2007.135
Autor:
Shahram Latifi, Venka Palaniappan
Publikováno v:
ICCS 2007 ISBN: 9781846289903
Most text documents contain a large amount of redundancy. Data compression can be used to minimize this redundancy and increase transmission efficiency or save storage space. Several text compression algorithms have been introduced for lossless text
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21078cf7f075ee6aaaf0535eb701f770
https://doi.org/10.1007/978-1-84628-992-7_28
https://doi.org/10.1007/978-1-84628-992-7_28
Autor:
Shahram Latifi, Venka Palaniappan
Publikováno v:
International Journal of High Performance Systems Architecture. 1:150
Hierarchical networks may be divided into subnetworks having the same topological properties of the original network. The star graph, an example of hierarchical networks, has been studied extensively as a viable candidate for massively parallel syste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc18220073f9eafcc6799278fab56266
https://doi.org/10.1504/ijhpsa.2008.021795
https://doi.org/10.1504/ijhpsa.2008.021795