Results 1  10
of
290
Simultaneous Linear Estimation of Multiple View Geometry and Lens Distortion
, 2001
"... A bugbear of uncalibrated stereo reconstruction is that cameras which deviate from the pinhole model have to be precalibrated in order to correct for nonlinear lens distortion. If they are not, and point correspondence is attempted using the uncorrected images, the matching constraints provided by ..."
Abstract

Cited by 127 (1 self)
 Add to MetaCart
radiallens model to another which (as we show) has equivalent power, but which takes a simpler form in homogeneous coordinates, and (2) expressing fundamental matrix estimation as a Quadratic Eigenvalue Problem (QEP), for which efficient algorithms are well known. I derive the new estimator, and compare its
An algorithm with linear expected running time for string editing with substitutions and substring reversals
"... The edit distance between given two strings X and Y is the minimum number of edit operations that transform X into Y without performing multiple operations in the same position. Ordinarily, string editing is based on character insert, delete, and substitute operations. Motivated from the facts that ..."
Abstract
 Add to MetaCart
that substring reversals are observed in genomic sequences, and it is not always possible to transform a given sequence X into a given sequence Y by reversals alone (e.g. X is all 0’s, and Y is all 1s), Muthukrishnan and Sahinalp [7, 8] considered a “simple ” welldefined edit distance model in which the edit
The reconstruction of doubled genomes
 SIAM Journal on Computing
"... Abstract. The genome can be modeled as a set of strings (chromosomes) of distinguished elements called genes. Genome duplication is an important source of new gene functions and novel physiological pathways. Originally (ancestrally), a duplicated genome contains two identical copies of each chromos ..."
Abstract

Cited by 53 (15 self)
 Add to MetaCart
of rearrangements can be decomposed into a succession of conserved segments, such that each segment appears exactly twice in the genome. We present exact algorithms for reconstructing the ancestral doubled genome in linear time, minimizing the number of rearrangement mutations required to derive the observed
Adding nesting structure to words
 In Developments in Language Theory, LNCS 4036
, 2006
"... We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linearhierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Neste ..."
Abstract

Cited by 119 (17 self)
 Add to MetaCart
We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linearhierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents
BlockIterative and StringAveraging Projection Algorithms in Proton Computed Tomography Image Reconstruction
, 2008
"... Proton computed tomography (pCT) is an imaging modality that is based on tracking individual protons as they traverse the object to be imaged. Protonbyproton tracking is necessary due to the effects of multiple Coulomb scattering (MCS), a process that deviates the proton path from a striaght line. ..."
Abstract

Cited by 12 (11 self)
 Add to MetaCart
. If optimal spatial resolution is to be achieved, the path of each proton must be predicted with a maximum likelihood formalism that models MCS. Further, image reconstruction methods are required that are able to handle these nonlinear paths. This had led to the exploration of algebraic reconstruction
An empirical Bayesian solution to the source reconstruction problem in EEG
 NEUROIMAGE
, 2005
"... Distributed linear solutions of the EEG source localisation problem are used routinely. In contrast to discrete dipole equivalent models, distributed linear solutions do not assume a fixed number of active sources and rest on a discretised fully 3D representation of the electrical activity of the br ..."
Abstract

Cited by 47 (9 self)
 Add to MetaCart
Distributed linear solutions of the EEG source localisation problem are used routinely. In contrast to discrete dipole equivalent models, distributed linear solutions do not assume a fixed number of active sources and rest on a discretised fully 3D representation of the electrical activity
Linear Time Algorithm for the Longest Common Repeat Problem
, 2005
"... Given a set of strings U = {T1, T2,..., Tℓ}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We also consider reversed and reversecomplemented repeats as well as normal repeats. We present a linear time algorithm for the lon ..."
Abstract
 Add to MetaCart
Given a set of strings U = {T1, T2,..., Tℓ}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We also consider reversed and reversecomplemented repeats as well as normal repeats. We present a linear time algorithm
Compression of partially ordered strings
 Proc. CONCUR 2003 (14th International Conference on Concurrency Theory
, 2003
"... Abstract. We introduce the problem of compressing partially ordered strings: given string σ ∈ Σ ∗ and a binary independence relation I over Σ, how can we compactly represent an input if the decompressor is allowed to reconstruct any string that can be obtained from σ by repeatedly swapping adjacent ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We introduce the problem of compressing partially ordered strings: given string σ ∈ Σ ∗ and a binary independence relation I over Σ, how can we compactly represent an input if the decompressor is allowed to reconstruct any string that can be obtained from σ by repeatedly swapping adjacent
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up ..."
Abstract
 Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up
Reconstruction of Gene Regulatory Networks under the Finite State Linear Model
"... We study the Finite State Linear Model (FSLM) for modelling gene regulatory networks proposed by A. Brazma and T. Schlitt in [4]. The model incorporates biologically intuitive gene regulatory mechanism similar to that in Boolean networks, and can describe also the continuous changes in protein level ..."
Abstract
 Add to MetaCart
levels. We consider several theoretical properties of this model; in particular we show that the problem whether a particular gene will reach an active state is algorithmically unsolvable. This imposes some practical difficulties in simulation and reverse engineering of FSLM networks. Nevertheless, our
Results 1  10
of
290