Sciweavers

Share
3 search results - page 1 / 1
» Challenging Complexity of Maximum Common Subgraph Detection ...
Sort
View
JGAA
2007
135views more  JGAA 2007»
9 years 11 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classi´Čüed. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
CVPR
2000
IEEE
11 years 1 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
BMCBI
2007
158views more  BMCBI 2007»
9 years 11 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
books