Sciweavers

170 search results - page 14 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
FOCS
2000
IEEE
15 years 2 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ICASSP
2011
IEEE
14 years 1 months ago
Compressive Sensing for over-the-air ultrasound
The advent of Compressive Sensing has provided significant mathematical tools to enhance the sensing capabilities of hardware devices. In this paper we apply Compressive Sensing ...
Petros Boufounos
DCC
2005
IEEE
15 years 9 months ago
Lossless Data Compression Using Optimal Tree Machines
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
Gergely Korodi, Jorma Rissanen, Ioan Tabus
MMS
2000
14 years 9 months ago
Failure Recovery Algorithms for Multimedia Servers
In this paper, we present two novel disk failure recovery methods that utilize the inherent characteristics of video streams for efficient recovery. Whereas the first method explo...
Prashant J. Shenoy, Harrick M. Vin