5922 search results - page 463 / 1185 » Navigability of Complex Networks |
117
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
136
click to vote
PE
2006
Springer
15 years 4 months ago
2006
Springer
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
148
click to vote
WDAG
2010
Springer
15 years 3 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
140
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider the channel selection problem in a cognitive radio network with heterogenous channel availabilities at different nodes. We formulate the maximum channel selection (MCS)...
188
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...