Sciweavers

28 search results - page 3 / 6
» jc 2007
Sort
View
JC
2007
130views more  JC 2007»
13 years 7 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
JC
2007
119views more  JC 2007»
13 years 7 months ago
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
Martin Avendano, Teresa Krick, Martín Sombr...
JC
2007
119views more  JC 2007»
13 years 7 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
JC
2007
101views more  JC 2007»
13 years 7 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
JC
2007
96views more  JC 2007»
13 years 7 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...