Sciweavers

62 search results - page 4 / 13
» Doing Good with Spam Is Hard
Sort
View
ECCC
1998
105views more  ECCC 1998»
13 years 7 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
FLAIRS
2006
13 years 8 months ago
Agile Sensor Networks: Adaptive Coverage via Mobile Nodes
Advances in sensing and communication technology make sensor networks a convenient and cost effective tool for collecting data in hard to reach and hazardous areas Increasingly, s...
Swapna Ghanekar, Fatma Mili, Imad Elhajj
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
14 years 28 days ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
CCS
2004
ACM
14 years 23 days ago
Testing network-based intrusion detection signatures using mutant exploits
Misuse-based intrusion detection systems rely on models of attacks to identify the manifestation of intrusive behavior. Therefore, the ability of these systems to reliably detect ...
Giovanni Vigna, William K. Robertson, Davide Balza...