Sciweavers

418 search results - page 31 / 84
» A New Pattern Representation Scheme Using Data Compression
Sort
View
ICA
2007
Springer
15 years 7 months ago
Discovering Convolutive Speech Phones Using Sparseness and Non-negativity
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can b...
Paul D. O'Grady, Barak A. Pearlmutter
IJON
2008
116views more  IJON 2008»
15 years 24 days ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
104
Voted
SPIRE
2009
Springer
15 years 7 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...
103
Voted
DKE
2007
101views more  DKE 2007»
15 years 23 days ago
Parameterized pattern queries
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
Cédric du Mouza, Philippe Rigaux, Michel Sc...
120
Voted
ICIP
2007
IEEE
16 years 2 months ago
Enable Efficient Compound Image Compression in H.264/AVC Intra Coding
This paper presents an efficient compound image compression approach based on H.264/AVC intra coding. The text blocks are distinguished from the picture blocks and compressed with...
Wenpeng Ding, Yan Lu, Feng Wu