Sciweavers

471 search results - page 21 / 95
» Case studies for self-organization in computer science
Sort
View
ICS
2010
Tsinghua U.
14 years 6 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
HICSS
2007
IEEE
172views Biometrics» more  HICSS 2007»
14 years 3 months ago
Support for Computer Forensics Examination Planning with Domain Modeling: A Report of One Experiment Trial
In any forensic investigation, planning and analysis activities are required in order to determine what digital media will be seized, what types of information will be sought in t...
Alfred C. Bogen, David A. Dampier, Jeffrey C. Carv...
ICALP
2009
Springer
14 years 9 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
COMPLEX
2009
Springer
14 years 3 months ago
A Preliminary Study on the Effects of Fear Factors in Disease Propagation
Upon an outbreak of a dangerous infectious disease, people generally tend to reduce their contacts with others in fear of getting infected. Such typical actions apparently help to ...
Yubo Wang, Jie Hu, Gaoxi Xiao, Limsoon Wong, Stefa...
FOCS
1999
IEEE
14 years 1 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi