140 search results - page 25 / 28 » Parameterized Algorithms for the Independent Set Problem in ... |
NIPS
2007
13 years 7 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
BMCBI
2010
13 years 5 months ago
2010
Background: The classification of protein sequences using string algorithms provides valuable insights for protein function prediction. Several methods, based on a variety of diff...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
BMCBI
2008
13 years 5 months ago
2008
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....