344 search results - page 49 / 69 » A constant factor approximation algorithm for a class of cla... |
139
click to vote
NIPS
2007
15 years 3 months ago
2007
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 ...
120
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
128
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
: Collaborative Dual-PLSA: Mining Distinction and Commonality across Multiple Domains for Text Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhon...
COLT
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
130
Voted
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...