Sciweavers

291 search results - page 10 / 59
» Approximate centerpoints with proofs
Sort
View
MOC
2011
13 years 5 months ago
Convergence of a mixed method for a semi-stationary compressible Stokes system
We propose and analyze a finite element method for a semi– stationary Stokes system modeling compressible fluid flow subject to a Navier– slip boundary condition. The veloci...
Kenneth H. Karlsen, Trygve K. Karper
ENTCS
2006
113views more  ENTCS 2006»
13 years 10 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
FOCS
1992
IEEE
14 years 2 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
FCT
2005
Springer
14 years 3 months ago
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
Wolfgang W. Bein, Lawrence L. Larmore, Linda Moral...
ICML
1995
IEEE
14 years 11 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon