Sciweavers

1095 search results - page 187 / 219
» Preprocessing of Intractable Problems
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
COMGEO
2008
ACM
13 years 7 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
BMCBI
2006
129views more  BMCBI 2006»
13 years 7 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...
JCP
2006
85views more  JCP 2006»
13 years 7 months ago
A Constructive Meta-Level Feature Selection Method based on Method Repositories
Feature selection is one of key issues related with data pre-processing of classification task in a data mining process. Although many efforts have been done to improve typical fea...
Hidenao Abe, Takahira Yamaguchi