Sciweavers

1658 search results - page 263 / 332
» Learning Unknown Graphs
Sort
View
NIPS
2001
13 years 9 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
JUCS
2010
217views more  JUCS 2010»
13 years 6 months ago
The 3A Personalized, Contextual and Relation-based Recommender System
Abstract: This paper discusses the 3A recommender system that targets CSCL (computersupported collaborative learning) and CSCW (computer-supported collaborative work) environments....
Sandy El Helou, Christophe Salzmann, Denis Gillet
ICCV
2009
IEEE
15 years 1 months ago
Domain Adaptive Semantic Diffusion for Large Scale Context-Based Video Annotation
Learning to cope with domain change has been known as a challenging problem in many real-world applications. This paper proposes a novel and efficient approach, named domain ada...
Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah ...
FLAIRS
2008
13 years 10 months ago
Towards Verification of Storyboards
Storyboards are commonly known as rows of pictures, which exemplarily sketch scenes in performing arts. The rows specify the sequence of scenes. The scenes themselves are illustra...
Rainer Knauf, Horst Duesel