1004 search results - page 72 / 201 » Product representations of polynomials |
PKDD
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
100
click to vote
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a method for solving the global illumination problem for synthetic diffuse objects. The approach generates realistic shading for applications where a synthetic object i...
106
click to vote
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
106
click to vote
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...