Sciweavers

6800 search results - page 1057 / 1360
» Testing with Functions as Specifications
Sort
View
ICFP
2009
ACM
16 years 6 months ago
Causal commutative arrows and their optimization
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...
Hai Liu, Eric Cheng, Paul Hudak
KDD
2007
ACM
160views Data Mining» more  KDD 2007»
16 years 6 months ago
Show me the money!: deriving the pricing power of product features by mining consumer reviews
The increasing pervasiveness of the Internet has dramatically changed the way that consumers shop for goods. Consumergenerated product reviews have become a valuable source of inf...
Nikolay Archak, Anindya Ghose, Panagiotis G. Ipeir...
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
16 years 6 months ago
Private approximation of search problems
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...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 6 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 6 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
« Prev « First page 1057 / 1360 Last » Next »