Sciweavers

45 search results - page 8 / 9
» On the communication and streaming complexity of maximum bip...
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 6 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
13 years 11 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
VTC
2008
IEEE
14 years 15 days ago
Irregular Generic Detection Aided Iterative Downlink SDMA Systems
— When an iterative-decoding aided system is configured to operate at a near-capacity performance, an excessive complexity may be imposed by the iterative process. In this paper...
Chun-Yi Wei, Lajos Hanzo
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 18 days ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
IPL
2006
141views more  IPL 2006»
13 years 6 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan