2192 search results - page 217 / 439 » Algorithms for Challenging Motif Problems |
157
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—We study the multi-source video on-demand application in multi-channel multi-radio wireless mesh networks. When a user initiates a new video request, the application can...
159
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
223
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
155
click to vote
TPDS
2010
15 years 2 months ago
2010
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
156
click to vote
IWCMC
2006
ACM
15 years 10 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...