An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

Rueda Luis; Oommen B. John

首页> 外文期刊>International journal of communication systems >An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

【24h】

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

机译：一种有效的数据通信压缩方案，它使用新的自组织二进制搜索树系列

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, we demonstrate that we can effectively use the results from the field of adaptive

机译：在本文中，我们证明了我们可以有效地利用自适应领域的结果

著录项

来源
《International journal of communication systems》 |2008年第10期|1-30|共30页
作者
Rueda Luis; Oommen B. John;
展开▼
作者单位

Department of Computer Science University of Concepcion Edmundo Larenas 215 Concepcion 4030000 Chile;

School of Computer Science Carleton University 1125 Colonel By Dr. Ottawa Ont. Canada K1S 5B6. Department of Information and Communication Technology University of Agder Grimstad Norway. School of Computer Science Carleton University 1125 Colonel By Dr. Ottawa Ont. Canada K1S 5B6;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
online encoding; adaptive data compression; binary search trees; adaptive data structures;

机译：在线编码;自适应数据压缩;二叉搜索树;自适应数据结构;

相似文献

外文文献
中文文献
专利

1. An efficient compression scheme for data communication which uses a new family of self-organizing binary search trees [J] . Luis Rueda, B. John Oommen International journal of communication systems . 2008,第10期

机译：一种有效的数据通信压缩方案，它使用新的自组织二进制搜索树系列
2. An Adaptive Indexed Binary Search Tree for Efficient Homomorphic Coercion Resistant Voting Scheme [J] . Vinodu George, M P Sebastian International Journal of Managing Information Technology . 2010,第1期

机译：高效的抗亚态强制投票方案的自适应索引二叉搜索树
3. Efficient construction of Optimal Binary Search Trees using Data Preprocessing to improve Quality and Attribute Post computing to save Space and time through modified Dynamic Programming Technique [J] . S.Hrushikesava Raju, Dr. T.Swarna Latha International Journal on Computer Science and Engineering . 2016,第1期

机译：通过改进的动态规划技术，使用数据预处理有效构建最佳二叉搜索树，以提高质量和属性后计算，从而节省空间和时间
4. Efficient Adaptive Data Compression Using Fano Binary Search Trees [C] . Luis Rueda, B. John Oommen International Symposium on Computer and Information Sciences(ISCIS 2005); 20051026-28; Istanbul(TR) . 2005

机译：使用Fano二进制搜索树的高效自适应数据压缩
5. Data structures, binary search trees: A study of random Weyl trees [D] . Goudjil, Amar 1999

机译：数据结构，二叉搜索树：随机Weyl树的研究
6. Two-point-based binary search trees for accelerating big data classification using KNN [O] . Ahmad B. A. Hassanat -1

机译：基于两点的二进制搜索树用于使用KNN加速大数据分类
7. An Efficient Compression Scheme for Data Communication Which Uses a New Family of Self-Organizing Binary Search Trees [O] . Luis Rueda, B. John Oommen 2009

机译：使用新的自组织二叉搜索树族的数据通信高效压缩方案
8. Pipeline synthetic aperture radar data compression utilizing systolic binary tree-searched architecture for vector quantization [R] . 1995

机译：利用收缩二叉树搜索结构进行矢量量化的流水线合成孔径雷达数据压缩

An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees

摘要

著录项

相似文献

相关主题

期刊订阅