837 search results - page 91 / 168 » Hard combinators |
116
Voted
EUROSYS
2009
ACM
16 years 18 days ago
2009
ACM
Some web sites provide interactive extensions using browser scripts, often without inspecting the scripts to verify that they are benign and bug-free. Others handle users’ conď¬...
154
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Network information distribution is a fundamental service for any anonymization network. Even though anonymization and information distribution about the network are two orthogona...
124
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
137
Voted
ICMI
2009
Springer
15 years 10 months ago
2009
Springer
Social interactions unfold over time, at multiple time scales, and can be observed through multiple sensory modalities. In this paper, we propose a machine learning framework for ...
148
click to vote
ESEM
2009
ACM
15 years 10 months ago
2009
ACM
: © Using Security Metrics Coupled with Predictive Modeling and Simulation to Assess Security Processes Yolanta Beres, Marco Casassa Mont, Jonathan Griffin, Simon Shiu HP Laborato...