Sciweavers

3818 search results - page 648 / 764
» Word Problems on Compressed Words
Sort
View
CORR
1998
Springer
84views Education» more  CORR 1998»
14 years 9 months ago
Comparing a statistical and a rule-based tagger for German
In this paper we present the results of comparing a statistical tagger for German based on decision trees and a rule-based Brill-Tagger for German. We used the same training corpu...
Martin Volk, Gerold Schneider
RECOMB
2001
Springer
15 years 10 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
EVOW
2010
Springer
15 years 4 months ago
Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist
Abstract. Finding appropriate parameter values for Evolutionary Algorithms (EAs) is one of the persistent challenges of Evolutionary Computing. In recent publications we showed how...
Selmar K. Smit, A. E. Eiben
RECOMB
2010
Springer
15 years 3 months ago
SubMAP: Aligning Metabolic Pathways with Subnetwork Mappings
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...
Ferhat Ay, Tamer Kahveci
FOCS
2004
IEEE
15 years 1 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev