咨询与建议

限定检索结果

文献类型

  • 1 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 2 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2 篇 理学
    • 2 篇 数学
  • 2 篇 工学
    • 2 篇 电气工程
    • 2 篇 计算机科学与技术...

主题

  • 2 篇 segmentation
  • 2 篇 sequential codin...
  • 2 篇 minimum descript...
  • 2 篇 weighting
  • 2 篇 strongly sequent...
  • 2 篇 redundancy
  • 2 篇 source block cod...
  • 2 篇 piecewise-statio...
  • 2 篇 change detection
  • 2 篇 transition path
  • 2 篇 ideal code lengt...
  • 2 篇 universal coding

机构

  • 2 篇 technion israel ...
  • 2 篇 univ notre dame ...

作者

  • 2 篇 shamir gi
  • 2 篇 merhav n

语言

  • 2 篇 英文
检索条件"主题词=strongly sequential coding"
2 条 记 录,以下是1-10 订阅
排序:
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1999年 第5期45卷 1498-1519页
作者: Shamir, GI Merhav, N Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel
Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with ... 详细信息
来源: 评论
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
Low-complexity sequential lossless coding for piecewise-stat...
收藏 引用
IEEE International Symposium on Information Theory
作者: Shamir, GI Merhav, N Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel
Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with ... 详细信息
来源: 评论