2695 search results - page 387 / 539 » Learning Graph Matching |
123
Voted
NIPS
2001
15 years 4 months ago
2001
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...
127
Voted
JAIR
2010
15 years 1 months ago
2010
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...
145
Voted
JUCS
2010
15 years 1 months ago
2010
Abstract: This paper discusses the 3A recommender system that targets CSCL (computersupported collaborative learning) and CSCW (computer-supported collaborative work) environments....
133
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
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...
126
Voted
COLT
2007
Springer
15 years 9 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...