Sciweavers

2740 search results - page 171 / 548
» Approximating Component Selection
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
15 years 7 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
ESANN
2001
15 years 4 months ago
Learning fault-tolerance in Radial Basis Function Networks
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...
Xavier Parra, Andreu Català
MOC
2002
107views more  MOC 2002»
15 years 2 months ago
Combined Hermite spectral-finite difference method for the Fokker-Planck equation
The convergence of a class of combined spectral-finite difference methods using Hermite basis, applied to the Fokker-Planck equation, is studied. It is shown that the Hermite based...
Johnson C. M. Fok, Benyu Guo, Tao Tang
MOC
1998
90views more  MOC 1998»
15 years 2 months ago
Numerical solution of parabolic integro-differential equations by the discontinuous Galerkin method
The numerical solution of a parabolic equation with memory is considered. The equation is first discretized in time by means of the discontinuous Galerkin method with piecewise co...
Stig Larsson, Vidar Thomée, Lars B. Wahlbin
CBSQ
2003
Springer
15 years 8 months ago
COTS-Based Requirements Engineering
There is growing interest in the notion of software development through the planned integration of COTS (Commercial Off-The-Shelf) products. The potential advantages of this integ...
Carina Alves