Sciweavers

467 search results - page 14 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
CAGD
2008
292views more  CAGD 2008»
13 years 10 months ago
Rotations, translations and symmetry detection for complexified curves
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
Peter Lebmeir, Jürgen Richter-Gebert
SIAMMAX
2010
111views more  SIAMMAX 2010»
13 years 4 months ago
Stochastic Galerkin Matrices
We investigate the structural, spectral, and sparsity properties of Stochastic Galerkin matrices as they arise in the discretization of linear differential equations with random co...
Oliver G. Ernst, Elisabeth Ullmann
JCT
2000
103views more  JCT 2000»
13 years 9 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver
TCSV
2002
99views more  TCSV 2002»
13 years 9 months ago
Embedded coring in MPEG video compression
Coring is a well-known technique for removing noise from images. The mechanism of coring consists of transforming a noise-degraded image into a frequency-domain representation, fol...
Peter M. B. van Roosmalen, Reginald L. Lagendijk, ...
STACS
2009
Springer
14 years 4 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay