Sciweavers

211 search results - page 33 / 43
» Digital Evidence
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
MOBISYS
2007
ACM
14 years 8 months ago
SmokeScreen: flexible privacy controls for presence-sharing
Presence-sharing is an emerging platform for mobile applications, but presence-privacy remains a challenge. Privacy controls must be flexible enough to allow sharing between both ...
Landon P. Cox, Angela Dalton, Varun Marupadi
MOBIHOC
2002
ACM
14 years 8 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
SAC
2009
ACM
14 years 3 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
CCS
2009
ACM
14 years 3 months ago
English shellcode
History indicates that the security community commonly takes a divide-and-conquer approach to battling malware threats: identify the essential and inalienable components of an att...
Joshua Mason, Sam Small, Fabian Monrose, Greg MacM...