Sciweavers

446 search results - page 47 / 90
» A fast algorithm for computing steiner edge connectivity
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
PR
2000
166views more  PR 2000»
13 years 7 months ago
A window-based inverse Hough transform
In this paper a new Hough transform inversion technique is proposed. It is a window-based inverse Hough transform algorithm, which reconstructs the original image using only the d...
Anastasios L. Kesidis, Nikos Papamarkos
DAGSTUHL
2003
13 years 9 months ago
Reliable Distance and Intersection Computation Using Finite Precision Geometry
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
Katja Bühler, Eva Dyllong, Wolfram Luther
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu