Sciweavers

2211 search results - page 213 / 443
» Comparing Approaches to Implement Feature Model Composition
Sort
View
BMCBI
2011
13 years 5 months ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...
CP
2007
Springer
14 years 4 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CVPR
2010
IEEE
14 years 5 months ago
Improving web-image search results using query-relative classifiers
Web image search using text queries has received considerable attention. However, current state-of-the-art approaches require training models for every new query, and are therefore...
Josip Krapac, Moray Allan, Jakob Verbeek, Frédér...
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 8 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
CVPR
2010
IEEE
14 years 4 months ago
Face Recognition Based on Image Sets
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
Hakan Cevikalp, Bill Triggs