1446 search results - page 30 / 290 » Testing for Concise Representations |
AISC
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
ESOP
2000
Springer
14 years 14 days ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
ISSS
1998
IEEE
14 years 1 months ago
1998
IEEE
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
An evolutionary synthesis method to design low-sensitivity IIR filters with linear phase in the passband is presented. The method uses a chromosome coding scheme based on the grap...
ICASSP
2011
IEEE
13 years 17 days ago
2011
IEEE
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...