Sciweavers

298 search results - page 14 / 60
» Computer security: quality rather than quantity
Sort
View
FC
2005
Springer
88views Cryptology» more  FC 2005»
14 years 3 months ago
Small Coalitions Cannot Manipulate Voting
We demonstrate how to make voting protocols resistant against manipulation by computationally bounded malicious voters, by extending the previous results of Conitzer and Sandholm i...
Edith Elkind, Helger Lipmaa
CSSE
2008
IEEE
14 years 4 months ago
Designing and Verifying Communication Protocols Using Model Driven Architecture and Spin Model Checker
Abstract: The need of communication protocols in today’s environment increases as much as the network explores. Many new kinds of protocols, e.g. for information sharing, securit...
Prabhu Shankar Kaliappan, Hartmut Koenig, Vishnu K...
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 9 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...
PPSN
2004
Springer
14 years 3 months ago
Constrained Evolutionary Optimization by Approximate Ranking and Surrogate Models
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
Thomas Philip Runarsson
NSDI
2008
14 years 4 days ago
Paper Rating vs. Paper Ranking
Within the computer-science community, submitted conference papers are typically evaluated by means of rating, in two respects: First, individual reviewers are asked to provide th...
John R. Douceur