Sciweavers

1006 search results - page 121 / 202
» What is this page known for
Sort
View
ASIACRYPT
2007
Springer
14 years 24 days ago
On Tweaking Luby-Rackoff Blockciphers
Abstract. Tweakable blockciphers, first formalized by Liskov, Rivest, and Wagner [13], are blockciphers with an additional input, the tweak, which allows for variability. An open p...
David Goldenberg, Susan Hohenberger, Moses Liskov,...
SIGGRAPH
2010
ACM
14 years 22 days ago
Seeing is believing: body motion dominates in multisensory conversations
In many scenes with human characters, interacting groups are an important factor for maintaining a sense of realism. However, little is known about what makes these characters app...
Cathy Ennis, Rachel McDonnell, Carol O'Sullivan
ICLP
2010
Springer
14 years 21 days ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 16 days ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
EUROCRYPT
2000
Springer
14 years 12 days ago
Minimal-Latency Secure Function Evaluation
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
Donald Beaver