Sciweavers

3155 search results - page 95 / 631
» How Are You Doing
Sort
View
ACSAC
2000
IEEE
14 years 6 days ago
Less Harm, Less Worry or How to Improve Network Security by Bounding System Offensiveness
In this paper we describe a new class of tools for protecting computer systems from security attacks. Their distinguished feature is the principle they are based on. Host or netwo...
Danilo Bruschi, Lorenzo Cavallaro, Emilia Rosti
CHI
2007
ACM
13 years 11 months ago
"Get real!": what's wrong with hci prototyping and how can we fix it?
A prototype of computing technology--as a means to evaluate and communicate a good idea--is often an essential step towards useful, shipping products and towards a deeper understa...
William Jones, Jared M. Spool, Jonathan Grudin, Vi...
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
13 years 11 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 7 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
IJNM
2008
112views more  IJNM 2008»
13 years 7 months ago
How to avoid packet droppers with proactive routing protocols for ad hoc networks
Routing protocols for mobile ad hoc networks (MANETs) have been an active area of research for the last decade, with many very interesting potential as well as actual applications...
Ignacy Gawedzki, Khaldoun Al Agha