5115 search results - page 420 / 1023 » On Randomized Lanczos Algorithms |
186
click to vote
ISSAC
2005
Springer
16 years 1 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
145
click to vote
WEA
2005
Springer
16 years 1 months ago
2005
Springer
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
207
click to vote
FSTTCS
2004
Springer
16 years 29 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
197
click to vote
WEA
2004
Springer
16 years 27 days ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
185
click to vote
COCO
2001
Springer
16 years 2 days ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...