Sciweavers

539 search results - page 36 / 108
» Linear complexity of transformed sequences
Sort
View
CPAIOR
2009
Springer
15 years 4 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
PET
2004
Springer
15 years 3 months ago
Secure Outsourcing of Sequence Comparisons
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
Mikhail J. Atallah, Jiangtao Li
BMCBI
2002
108views more  BMCBI 2002»
14 years 9 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
ECCV
2010
Springer
14 years 10 months ago
Piecewise Quadratic Reconstruction of Non-Rigid Surfaces from Monocular Sequences
Abstract. In this paper we present a new method for the 3D reconstruction of highly deforming surfaces (for instance a flag waving in the wind) viewed by a single orthographic came...
João Fayad, Lourdes de Agapito, Alessio Del...
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
15 years 4 months ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller