Sciweavers

1095 search results - page 14 / 219
» Preprocessing of Intractable Problems
Sort
View
IADIS
2008
13 years 9 months ago
Ontology In Association Rules Pre-Processing And Post-Processing
Data mining has emerged to address the problem of transforming data into useful knowledge. Although most data mining techniques, such as Association Rules, substantially reduce th...
Inhaúma Neves Ferraz, Ana Cristina Bicharra...
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 1 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
BMCBI
2010
157views more  BMCBI 2010»
13 years 7 months ago
SeqTrim: a high-throughput pipeline for pre-processing any type of sequence read
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
Juan Falgueras, Antonio J. Lara, Noé Fern&a...
COR
2008
99views more  COR 2008»
13 years 7 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
ICALP
2007
Springer
14 years 1 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier