Sciweavers

269 search results - page 11 / 54
» Computing the inverse sort transform in linear time
Sort
View
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
13 years 11 months ago
Generating Robust Trajectories in the Presence of Ordinary and Linear-Self-Motion Singularities
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
John E. Lloyd, Vincent Hayward
JCB
2008
111views more  JCB 2008»
13 years 6 months ago
Sorting Genomes with Centromeres by Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
Michal Ozery-Flato, Ron Shamir
PPSC
1993
13 years 8 months ago
Parallel Preconditioning and Approximate Inverses on the Connection Machine
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
Marcus J. Grote, Horst D. Simon
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
DAM
2007
120views more  DAM 2007»
13 years 7 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot