2356 search results - page 125 / 472 » Characterizations of postman sets |
175
click to vote
MP
2011
14 years 11 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
146
click to vote
ORDER
2011
14 years 11 months ago
2011
For a finite poset P = (V, ≤), let Bs(P) consist of all triples (x, y, z) ∈ V 3 such that either x < y < z or z < y < x. Similarly, for every finite, simple, and...
166
click to vote
PAMI
2011
14 years 11 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
177
click to vote
TIT
2011
14 years 11 months ago
2011
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
131
click to vote
TIT
2011
14 years 11 months ago
2011
—“If we know more, we can achieve more.” This adage also applies to networks, where more information about the network state translates into higher sum-rates. In this paper, ...