2168 search results - page 153 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
138
click to vote
MLDM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A statistical technique is developed for estimating the support of itemsets on data streams, regardless of the size of the data stored. This technique, which is computati...
158
click to vote
JMLR
2010
14 years 11 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
166
click to vote
EUROCRYPT
2011
Springer
14 years 7 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
161
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We present a new approach to reconstruct the shape of a 3D object or scene from a set of calibrated images. The central idea of our method is to combine the topological flexibilit...
130
click to vote
ARITH
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the availabl...