Sciweavers

514 search results - page 7 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
JMLR
2010
99views more  JMLR 2010»
13 years 2 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
SIGCOMM
2006
ACM
14 years 1 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
CHI
2011
ACM
12 years 11 months ago
Understanding interaction design practices
There is an undesirable gap between HCI research aimed at influencing interaction design practice and the practitioners in question. To close this gap, we advocate a theoretical a...
Elizabeth Goodman, Erik Stolterman, Ron Wakkary
TON
2002
81views more  TON 2002»
13 years 7 months ago
Robust rate control for integrated services packet networks
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
Franco Blanchini, Renato Lo Cigno, Roberto Tempo
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 10 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...