Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
The main objective of the course is for students to be able to analyze problems in microeconomic theory at the beginning graduate level. Students successfully completing the course...
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
Changhu Wang (University of Science and Technology...
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...