62 search results - page 5 / 13 » A New Approach and Faster Exact Methods for the Maximum Comm... |
JCB
2007
13 years 8 months ago
2007
Discovering topological motifs or common topologies in one or more graphs is an important as well as an interesting problem. It had been classically viewed as the subgraph isomorp...
ICCAD
1997
IEEE
14 years 23 days ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
CORR
2011
Springer
13 years 3 days ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
BMCBI
2007
13 years 8 months ago
2007
Background: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are c...