Sciweavers

714 search results - page 67 / 143
» An efficient algorithm for positive realizations
Sort
View
VMV
2001
160views Visualization» more  VMV 2001»
15 years 1 months ago
Interactive Repositioning of Bone Fracture Segments
This paper presents an application for semiautomatic repositioning of bone fractures that allows the merging of several fragments. This application has been developed with regard ...
Michael Scheuering, Christof Rezk-Salama, Christia...
CVGIP
2002
126views more  CVGIP 2002»
14 years 11 months ago
Dual Mesh Resampling
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
Gabriel Taubin
DAM
2007
120views more  DAM 2007»
14 years 11 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
TCS
2008
14 years 11 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
TWC
2010
14 years 6 months ago
Robustness analysis and new hybrid algorithm of wideband source localization for acoustic sensor networks
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
Kun Yan, Hsiao-Chun Wu, S. Sitharama Iyengar