507 search results - page 58 / 102 » Computing Sparse Multiples of Polynomials |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Reliable detection of human activity is an unsolved problem. The main is that low resolution and the unconstrained nature of realistic environments and human behaviourmakeform cue...