Sciweavers

250 search results - page 46 / 50
» Reorganizing compressed text
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
WIAMIS
2009
IEEE
14 years 2 months ago
Feature-based video key frame extraction for low quality video sequences
We present an approach to key frame extraction for structuring user generated videos on video sharing websites (e. g. YouTube). Our approach is intended to link existing image sea...
Pascal Kelm, Sebastian Schmiedeke, Thomas Sikora
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
14 years 2 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
ICCBR
2007
Springer
14 years 1 months ago
Catching the Drift: Using Feature-Free Case-Based Reasoning for Spam Filtering
In this paper, we compare case-based spam filters, focusing on their resilience to concept drift. In particular, we evaluate how to track concept drift using a case-based spam fi...
Sarah Jane Delany, Derek G. Bridge
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng