Publikationerna i listan är inte nödvändigtvis del av CIAM finansierade projekt utan inkluderar även andra tillämpningsorienterade arbeten av CIAM medarbetare.

[1] M. Ryner, J.-O. Strömberg, C. Söderberg-Nauclr, and M. Homman-Loudiyi. Identication and classication of human cytomegalovirus capsids in textured electron micrographs using deformed template matching. Virology Journal, 3(57), 2006. [ bib | DOI ]
[2] S. A. Andersson and J. Lagergren. Motif Yggdrasil: Sampling from a tree mixture model. In Tenth Annual International Conference on Research in Computational Molecular Biology (RECOMB 2006), pages 458-472, 2006. [ bib ]
[3] Ö. P. Svensson, L. Arvestad, and J. Lagergren. Genome-wide survey for biologically functional pseudogenes. PLoS Computational Biology, 2(5):e46 DOI: 10.1371/journal.pcbi.0020046, 2006. [ bib ]
[4] M. Hjelm, M. Höglund, and J. Lagergren. New probabilistic network models and algorithms for oncogenesis. Journal of Computational Biology, 13(4):853-865, May 2006. [ bib ]
[5] D. Bryant and J. Lagergren. Compatibility of unrooted phylogenetic trees is FPT. Theoretical Computer Science, 351:296-302, 2006. [ bib ]
[6] A. Forsgren. On the behavior of the conjugate-gradient method on ill-conditioned problems. Report TRITA-MAT-2006-OS1, Department of Mathematics, School of Engineering Sciences, KTH - Royal Institute of Technology, Stockholm, 2006. [ bib ]
[7] A. Forsgren. On warm starts for interior methods. In F. Ceragioli, A. Dontchev, H. Furuta, K. Marti, and L. Pandolfi, editors, System Modeling and Optimization, volume 199 of IFIP International Federation for Information Processing, pages 51-66. Springer-Verlag, 2006. [ bib ]
[8] J. Backelin and S. Linusson. Parity splits of x-trees by tripple point distance. Annals of Combinatorics, 10(1):1-18, 2006. [ bib ]
[9] E. Chung and B. Engquist. Optimal discontinuous Galerkin methods for wave propagation. SIAM Journal on Numerical Analysis, 44:2131-2158, 2006. [ bib ]
[10] A.-K. Tornberg, B. Engquist, B. Gustafsson, and P. Wahlund. A new type of boundary treatment for wave propagation. BIT, 46(145-170), 2006. [ bib ]
[11] M. Motamed and O. Runborg. A fast phase space method for computing creeping rays. Journal of Computational Physics, 219:276-295, 2006. [ bib ]
[12] D. Anisi. Online trajectory planning and observer based control. Licentiate thesis, Department of Mathematics, School of Engineering Sciences, KTH - Royal Institute of Technology, Stockholm, 2006. [ bib ]
[13] C. I. Byrnes and A. Lindquist. The generalized moment problem with complexity constraint. Integral Equations and Operator Theory, 56(2):163-180, 2006. [ bib ]
[14] F. Carlsson and A. Forsgren. Iterative regularization in intensity-modulated radiation therapy optimization. Medical Physics, 33:225-234, 2006. [ bib ]
[15] F. Carlsson, A. Forsgren, H. Rehbinder, and K. Eriksson. Using eigenstructure of the Hessian to reduce the dimension of the intensity modulated radiation therapy optimization problem. Annals of Operations Research, 148:81-94, 2006. [ bib ]
[16] T. T. Georgiou and A. Lindquist. Remarks on control design with degree constraint. IEEE Transactions on Automatic Control, AC-51:1150-1156, July 2006. [ bib ]
[17] J. Håstad. The square lattice shuffle. Random structures and Algorithms, 29:466-474, 2006. [ bib ]
[18] L. Fainsilber, P. Kurlberg, and B. Wennberg. Lattice points on circles and discrete velocity models for the Boltzmann equation. SIAM Journal on Mathematical Analysis, 37(6):1903-1922 (electronic), 2006. [ bib | http ]

This file was generated by bibtex2html 1.94.

Till sidans topp