Sciweavers

1221 search results - page 218 / 245
» Balanced graph partitioning
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Scalable NIDS via Negative Pattern Matching and Exclusive Pattern Matching
i In this paper, we identify the unique challenges in deploying parallelism on TCAM-based pattern matching for Network Intrusion Detection Systems (NIDSes). We resolve two critica...
Kai Zheng, Xin Zhang, Zhiping Cai, Zhijun Wang, Ba...
TWC
2010
13 years 2 months ago
Optimized opportunistic multicast scheduling (OMS) over wireless cellular networks
Optimized opportunistic multicast scheduling (OMS) is studied for cellular networks, where the problem of efficiently transmitting a common set of fountain-encoded data from a sin...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
ISCA
2011
IEEE
269views Hardware» more  ISCA 2011»
12 years 11 months ago
Crafting a usable microkernel, processor, and I/O system with strict and provable information flow security
High assurance systems used in avionics, medical implants, and cryptographic devices often rely on a small trusted base of hardware and software to manage the rest of the system. ...
Mohit Tiwari, Jason Oberg, Xun Li 0001, Jonathan V...
CORR
2011
Springer
200views Education» more  CORR 2011»
12 years 11 months ago
Analytical Evaluation of Fractional Frequency Reuse for OFDMA Cellular Networks
Fractional frequency reuse (FFR) is an interference management technique well-suited to OFDMAbased cellular networks wherein the cells are partitioned into spatial regions with di...
Thomas David Novlan, Radha Krishna Ganti, Arunabha...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar