Sciweavers

2254 search results - page 120 / 451
» Computing the minimal covering set
Sort
View
96
Voted
BMCBI
2008
105views more  BMCBI 2008»
15 years 27 days ago
Novel computational methods for increasing PCR primer design effectiveness in directed sequencing
Background: Polymerase chain reaction (PCR) is used in directed sequencing for the discovery of novel polymorphisms. As the first step in PCR directed sequencing, effective PCR pr...
Kelvin Li, Anushka Brownley, Timothy B. Stockwell,...
86
Voted
ICFCA
2007
Springer
15 years 7 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
ICMLA
2009
14 years 10 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson
IWPEC
2004
Springer
15 years 6 months ago
A Structural View on Parameterizing Problems: Distance from Triviality
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...
Jiong Guo, Falk Hüffner, Rolf Niedermeier
96
Voted
IJAC
2002
128views more  IJAC 2002»
15 years 17 days ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki