Sciweavers

64 search results - page 4 / 13
» Compression of Partially Ordered Strings
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
13 years 8 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
SIGPRO
2010
135views more  SIGPRO 2010»
13 years 7 months ago
A short note on compressed sensing with partially known signal support
This short note studies a variation of the Compressed Sensing paradigm introduced recently by Vaswani et al., i.e. the recovery of sparse signals from a certain number of linear m...
Laurent Jacques
AUTOMATICA
2007
76views more  AUTOMATICA 2007»
13 years 8 months ago
Fault-tolerant compression filters by time-propagated measurement fusion
For fault-tolerant real-time filtering, an efficient two-filter architecture is proposed. In the two-filter architecture, a host filter is operated permanently. A compression filt...
Hyung Keun Lee, Jang Gyu Lee
MCS
2008
Springer
13 years 8 months ago
Numerical optimal control of the wave equation: optimal boundary control of a string to rest in finite time
In many real-life applications of optimal control problems with constraints in form of partial differential equations (PDEs), hyperbolic equations are involved which typically desc...
Matthias Gerdts, Günter Greif, Hans Josef Pes...
MFCS
2005
Springer
14 years 2 months ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...