Sciweavers

1658 search results - page 314 / 332
» Learning Unknown Graphs
Sort
View
CII
2008
100views more  CII 2008»
13 years 8 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 8 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 8 months ago
Image Segmentation by Discounted Cumulative Ranking on Maximal Cliques
We propose a mid-level image segmentation framework that combines multiple figure-ground hypothesis (FG) constrained at different locations and scales, into interpretations that t...
João Carreira, Adrian Ion, Cristian Sminchi...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
AI
2006
Springer
13 years 8 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth