2100 search results - page 335 / 420 » Learning to rank on graphs |
173
click to vote
NIPS
2001
15 years 7 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...
167
click to vote
JAIR
2010
15 years 4 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...
176
click to vote
ICCV
2009
IEEE
16 years 11 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...
163
click to vote
COLT
2007
Springer
16 years 18 days 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...
192
click to vote
FLAIRS
2008
15 years 8 months ago
2008
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...