9736 search results - page 27 / 1948 » How Fast Can We Compute Products |
131
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
148
click to vote
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
254
click to vote
CIMAGING
2009
15 years 5 months ago
2009
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
132
click to vote
IUI
2003
ACM
15 years 9 months ago
2003
ACM
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
126
click to vote
EUROCRYPT
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...