Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. ...
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
—In this contribution an accurate average bit error rate (BER) formula is derived for Nakagami-faded MC-DSCDMA in the context of asynchronous transmissions and random spreading s...