Sciweavers

418 search results - page 3 / 84
» A New Pattern Representation Scheme Using Data Compression
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Audio Signal Representations for Factorization in the Sparse Domain
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
CEC
2005
IEEE
13 years 11 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 5 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
DSD
2010
IEEE
171views Hardware» more  DSD 2010»
13 years 4 months ago
Test Patterns Compression Technique Based on a Dedicated SAT-Based ATPG
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
Jiri Balcarek, Petr Fiser, Jan Schmidt
ICPR
2004
IEEE
14 years 6 months ago
Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition
This paper presents a new approach for representing multidimensional data by a compact number of bases. We consider the multidimensional data as tensors instead of matrices or vec...
Hongcheng Wang, Narendra Ahuja