Sciweavers

4137 search results - page 711 / 828
» On the number of matchings of a tree
Sort
View
TALG
2008
124views more  TALG 2008»
13 years 7 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
TCS
2008
13 years 7 months ago
On the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
TCS
2008
13 years 7 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
TIP
2008
122views more  TIP 2008»
13 years 7 months ago
Efficient 2-D Grayscale Morphological Transformations With Arbitrary Flat Structuring Elements
Abstract--An efficient algorithm is presented for the computation of grayscale morphological operations with arbitrary 2-D flat structuring elements (S.E.). The required computing ...
Erik R. Urbach, Michael H. F. Wilkinson
BMCBI
2005
150views more  BMCBI 2005»
13 years 7 months ago
Approaching the taxonomic affiliation of unidentified sequences in public databases - an example from the mycorrhizal fungi
Background: During the last few years, DNA sequence analysis has become one of the primary means of taxonomic identification of species, particularly so for species that are minut...
R. Henrik Nilsson, Erik Kristiansson, Martin Ryber...