2397 search results - page 52 / 480 » Applications of integer relation algorithms |
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
ICDE
2006
IEEE
15 years 11 days ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
IPPS
1998
IEEE
14 years 3 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
VLDB
2002
ACM
13 years 10 months ago
2002
ACM
We enunciate the need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking,...