222 search results - page 33 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
COLT
1995
Springer
13 years 11 months ago
1995
Springer
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on...
BMCBI
2008
13 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
SIAMSC
2010
13 years 5 months ago
2010
In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total variation regularization. Although much effort has been de...