Sciweavers

1469 search results - page 82 / 294
» Approximate polynomial decomposition
Sort
View
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
CVPR
2008
IEEE
15 years 12 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
FOCS
2007
IEEE
15 years 4 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
CORR
2008
Springer
159views Education» more  CORR 2008»
14 years 10 months ago
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. H...
MOC
2002
86views more  MOC 2002»
14 years 9 months ago
Hermite interpolation of nonsmooth functions preserving boundary conditions
Abstract. This article is devoted to the construction of a Hermite-type regularization operator transforming functions that are not necessarily C1 into globally C1 finite-element f...
V. Girault, L. R. Scott