16257 search results - page 32 / 3252 » D-finiteness: algorithms and applications |
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
BICOB
2009
Springer
14 years 3 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
IFIPTCS
2000
14 years 11 days ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
HIS
2003
13 years 10 months ago
2003
Abstract. This paper proposes the fitness control procedure for the application of genetic algorithms (GA) in pattern recognition. Instead of using GA to solve a concomitant optim...