Sciweavers

4860 search results - page 843 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 6 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin
KDD
2002
ACM
126views Data Mining» more  KDD 2002»
16 years 6 months ago
Integrating feature and instance selection for text classification
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
Dimitris Fragoudis, Dimitris Meretakis, Spiros Lik...
RECOMB
2007
Springer
16 years 6 months ago
Support Vector Training of Protein Alignment Models
Abstract. Sequence to structure alignment is an important step in homology modeling of protein structures. Incorporation of features like secondary structure, solvent accessibility...
Chun-Nam John Yu, Thorsten Joachims, Ron Elber, Ja...
CADE
2006
Springer
16 years 6 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 6 months ago
An information-theoretic approach to normal forms for relational and XML data
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
Marcelo Arenas, Leonid Libkin