Sciweavers

2957 search results - page 207 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
GRID
2003
Springer
15 years 11 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
DCG
2010
104views more  DCG 2010»
15 years 4 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
MOC
2010
15 years 1 months ago
Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
James H. Bramble, Joseph E. Pasciak, Dimitar Trene...
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
16 years 4 days ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
ICCSA
2003
Springer
15 years 11 months ago
Uniform Approximations for Transcendental Functions
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...
Serge Winitzki