Sciweavers

1469 search results - page 217 / 294
» Approximate polynomial decomposition
Sort
View
ITA
2007
101views Communications» more  ITA 2007»
15 years 6 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
TOMS
2008
87views more  TOMS 2008»
15 years 6 months ago
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
We introduce three fast contouring algorithms for visualizing the solution of Partial Differential Equations based on the PCI (Pure Cubic Interpolant). The PCI is a particular pie...
Hassan Goldani-Moghaddam, Wayne H. Enright
JSCIC
2007
131views more  JSCIC 2007»
15 years 6 months ago
An Analysis of the Minimal Dissipation Local Discontinuous Galerkin Method for Convection-Diffusion Problems
Abstract. We analyze the so-called the minimal dissipation local discontinuous Galerkin method for convection-diffusion or diffusion problems. The distinctive feature of this met...
Bernardo Cockburn, Bo Dong
JWSR
2007
89views more  JWSR 2007»
15 years 6 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
MOC
2002
135views more  MOC 2002»
15 years 6 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami