3708 search results - page 628 / 742 » Approximating Betweenness Centrality |
130
click to vote
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
117
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
117
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
A wireless system with multiple channels is considered, where each channel has several transmission states. A user learns about the instantaneous state of an available channel by ...
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
DC
2010
15 years 23 days ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...