Sciweavers

2930 search results - page 56 / 586
» The optimal sequence compression
Sort
View
ICIP
2001
IEEE
15 years 11 months ago
Bayesian resolution-enhancement framework for transform-coded video
Resolution enhancement for video sequences has always been an attractive application in multimedia signal processing. "Superresolution" methods, that combine non-redunda...
Bahadir K. Gunturk, Yucel Altunbasak, Russell M. M...
ICIP
2007
IEEE
15 years 4 months ago
A Novel Image Re-Indexing by Self Organizing Motor Maps
Palette re-ordering is a well known and very effective approach for improving the compression of color indexed images. If the spatial distribution of the indexes in the image is s...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
BMCBI
2006
141views more  BMCBI 2006»
14 years 10 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
13 years 9 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro
DAC
2001
ACM
15 years 10 months ago
Improved Cut Sequences for Partitioning Based Placement
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
Mehmet Can Yildiz, Patrick H. Madden