Sciweavers

13457 search results - page 39 / 2692
» Can we elect if we cannot compare
Sort
View
CCS
2009
ACM
13 years 11 months ago
On voting machine design for verification and testability
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
Cynthia Sturton, Susmit Jha, Sanjit A. Seshia, Dav...
IACR
2011
158views more  IACR 2011»
12 years 7 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...
CN
2010
130views more  CN 2010»
13 years 5 months ago
CoreCast: How core/edge separation can help improving inter-domain live streaming
The rapid growth of broadband access has popularized multimedia services, which nowadays contribute to a large part of Internet traffic. Among this content, the broadcasting of li...
Loránd Jakab, Albert Cabellos-Aparicio, Tho...

Publication
218views
12 years 2 days ago
Comparing Visual Feature Coding for Learning Disjoint Camera Dependencies
This paper systematically investigates the effectiveness of different visual feature coding schemes for facilitating the learning of time-delayed dependencies among disjoint multi-...
Xiatian Zhu, Shaogang Gong, and Chen Change Loy
MANSCI
2010
104views more  MANSCI 2010»
13 years 6 months ago
Valuing Money and Things: Why a $20 Item Can Be Worth More and Less Than $20
The study of risky decision-making has long used monetary gambles to study choice, but many everyday decisions do not involve the prospect of winning or losing money. Monetary gam...
A. Peter McGraw, Eldar Shafir, Alexander Todorov