Sciweavers

564 search results - page 7 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
JDA
2007
156views more  JDA 2007»
13 years 7 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
ICDT
2007
ACM
141views Database» more  ICDT 2007»
14 years 1 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
DAGSTUHL
2008
13 years 9 months ago
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
Walter Krämer, Michael Zimmer
COMPGEOM
2004
ACM
14 years 1 months ago
An energy-driven approach to linkage unfolding
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
Jason H. Cantarella, Erik D. Demaine, Hayley N. Ib...