1254 search results - page 158 / 251 » Making Hard Problems Harder |
CCS
2009
ACM
14 years 4 months ago
2009
ACM
Binary attestation, as proposed by the Trusted Computing Group (TCG), is a pragmatic approach for software integrity protection and verification. However, it has also various sho...
WCRE
2009
IEEE
14 years 4 months ago
2009
IEEE
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
COCO
2009
Springer
14 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
SIGCOMM
2009
ACM
14 years 4 months ago
2009
ACM
Network protocol designers, both at the physical and network level, have long considered interference and simultaneous transmission in wireless protocols as a problem to be avoide...