Sciweavers

page 59900 / 60054
» publications
Sort
View
TON
2012
13 years 9 months ago
A New Cell-Counting-Based Attack Against Tor
Abstract—Various low-latency anonymous communication systems such as Tor and Anonymizer have been designed to provide anonymity service for users. In order to hide the communicat...
Zhen Ling, Junzhou Luo, Wei Yu, Xinwen Fu, Dong Xu...
TON
2012
13 years 9 months ago
Declarative Policy-Based Adaptive Mobile Ad Hoc Networking
—This paper presents DAWN, a declarative platform that creates highly adaptive policy-based MANET protocols. DAWN leverages declarative networking techniques to achieve extensibl...
Changbin Liu, Ricardo Correa, Xiaozhou Li, Prithwi...
TON
2012
13 years 9 months ago
Opportunistic Flow-Level Latency Estimation Using Consistent NetFlow
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
TON
2012
13 years 9 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
« Prev « First page 59900 / 60054 Last » Next »