Sciweavers

1968 search results - page 306 / 394
» The Complexity of Valued Constraint Models
Sort
View
NIPS
2007
14 years 11 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
AI
2008
Springer
14 years 10 months ago
The well-designed young mathematician
This paper complements McCarthy's "The well designed child", in part by putting it in a broader context, the space of possible well designed progeny, and in part by...
Aaron Sloman
AAMAS
2004
Springer
14 years 9 months ago
Automated Assistants for Analyzing Team Behaviors
Multi-agent teamwork is critical in a large number of agent applications, including training, education, virtual enterprises and collective robotics. The complex interactions of ag...
Ranjit Nair, Milind Tambe, Stacy Marsella, Taylor ...
CIKM
2009
Springer
15 years 4 months ago
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
RECOMB
2005
Springer
15 years 10 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao