Sciweavers

114 search results - page 14 / 23
» Reasoning over Networks by Symbolic Methods
Sort
View
AAAI
2008
15 years 4 months ago
AnalogySpace: Reducing the Dimensionality of Common Sense Knowledge
We are interested in the problem of reasoning over very large common sense knowledge bases. When such a knowledge base contains noisy and subjective data, it is important to have ...
Robert Speer, Catherine Havasi, Henry Lieberman
JAIR
2010
145views more  JAIR 2010»
15 years 9 days ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
74
Voted
CVPR
1996
IEEE
15 years 6 months ago
Extracting Salient Curves from Images: An Analysis of the Saliency Network
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
T. D. Alter, Ronen Basri
BMCBI
2010
150views more  BMCBI 2010»
15 years 1 months ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
IJAR
2010
152views more  IJAR 2010»
15 years 9 days ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...