7924 search results - page 1129 / 1585 » Non-Malleable Functions and Their Applications |
203
click to vote
DAC
2001
ACM
16 years 8 months ago
2001
ACM
Milenko Drinic UCLA Computer Science Dep. 4732 Boelter Hall Los Angeles, CA 90095-1596 milenko@cs.ucla.edu Darko Kirovski Microsoft Research One Microsoft Way Redmond, WA 98052 da...
431
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
180
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
315
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
184
click to vote
TEI
2010
ACM
16 years 1 months ago
2010
ACM
Swing That Thing… is a practice-based doctoral research project that examines how technology in on and around the body might be used to poeticise experience. Outcomes include a ...