3630 search results - page 321 / 726 » Fast Marching Methods |
152
click to vote
ISCAS
1993
IEEE
15 years 10 months ago
1993
IEEE
An algorithm is presented for fast implementation of time-varying wavelet packets maintaining perfect reconstruction throughout transitions. It is based on filter banks known as t...
162
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
145
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
We present three methods for the integration of symmetries into reachability analysis. Two of them lead to perfect reduction but their runtime depends on the symmetry structure. Th...
143
Voted
SYRCODIS
2008
15 years 7 months ago
2008
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
171
Voted
ESANN
2006
15 years 7 months ago
2006
This contribution describes an almost parameterless iterative context compilation method, which produces feature layers, that are especially suited for mixed bottom-up top-down ass...