31 search results - page 4 / 7 » Effective Capacity and Randomness of Closed Sets |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted...
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
CCS
2005
ACM
14 years 26 days ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...