Sciweavers

201 search results - page 17 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
BMCBI
2010
112views more  BMCBI 2010»
13 years 8 months ago
A parameter-adaptive dynamic programming approach for inferring cophylogenies
Background: Coevolutionary systems like hosts and their parasites are commonly used model systems for evolutionary studies. Inferring the coevolutionary history based on given phy...
Daniel Merkle, Martin Middendorf, Nicolas Wieseke
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 8 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
IMAGING
2000
13 years 10 months ago
Local Color Correction Using Non-Linear Masking
Tone reproduction is a key component in image quality and historically tone correction has been performed on a global basis for a given device or image. Several recent investigati...
Nathan Moroney
SPIRE
2005
Springer
14 years 2 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira