269 search results - page 22 / 54 » Computing the inverse sort transform in linear time |
COMPGEOM
2010
ACM
14 years 7 days ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
CCGRID
2001
IEEE
13 years 11 months ago
2001
IEEE
In this paper, we address the new problem of protecting volunteer computing systems from malicious volunteers who submit erroneous results by presenting sabotagetolerance mechanis...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
- Multithreading aims to tolerate latency by overlapping communication with computation. This report explicates the multithreading capabilities of the EM-X distributed-memory multi...