Sciweavers

2060 search results - page 227 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
ICC
2009
IEEE
113views Communications» more  ICC 2009»
15 years 3 months ago
Using GMM and SVM-Based Techniques for the Classification of SSH-Encrypted Traffic
When employing cryptographic tunnels such as the ones provided by Secure Shell (SSH) to protect their privacy on the Internet, users expect two forms of protection. First, they aim...
Maurizio Dusi, Alice Este, Francesco Gringoli, Luc...
FOCS
2003
IEEE
15 years 11 months ago
Always Good Turing: Asymptotically Optimal Probability Estimation
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
ICPPW
2002
IEEE
15 years 10 months ago
MigThread: Thread Migration in DSM Systems
Distributed Shared Memory (DSM) systems provide a logically shared memory over physically distributed memory to enable parallel computation on Networks of Workstations (NOWs). In ...
Hai Jiang, Vipin Chaudhary
IPPS
2007
IEEE
16 years 6 hour ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...