Sciweavers

2421 search results - page 209 / 485
» Approximate Flow-Aware Networking
Sort
View
135
Voted
MP
2007
100views more  MP 2007»
15 years 3 months ago
Power optimization for connectivity problems
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. ...
141
Voted
NECO
2007
127views more  NECO 2007»
15 years 3 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
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...
Joseph F. Murray, Kenneth Kreutz-Delgado
179
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 10 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
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...
Amita Gajewar, Atish Das Sarma
131
Voted
ICIP
2005
IEEE
16 years 5 months ago
Video summarization for multiple path communication
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...
Zhu Li, Guido M. Schuster, Aggelos K. Katsaggelos
145
Voted
WCNC
2008
IEEE
15 years 10 months ago
Exact BER Performance of Asynchronous MC-DS-CDMA over Nakagami-m Fading Channels
—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...
Besma Smida, Lajos Hanzo, Sofiène Affes