Sciweavers

1326 search results - page 108 / 266
» Approximate Tree Kernels
Sort
View
MOC
1998
90views more  MOC 1998»
13 years 8 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
VISUALIZATION
1997
IEEE
14 years 1 months ago
Fast oriented line integral convolution for vector field visualization via the Internet
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
Rainer Wegenkittl, Eduard Gröller
CMPB
2010
96views more  CMPB 2010»
13 years 9 months ago
Towards real-time radiation therapy: GPU accelerated superposition/convolution
We demonstrate the use of highly parallel graphics processing units (GPUs) to accelerate the Superposition/Convolution (S/C) algorithm to interactive rates while reducing the numbe...
Robert Jacques, Russell Taylor, John Wong, Todd Mc...
SIAMNUM
2010
96views more  SIAMNUM 2010»
13 years 3 months ago
A Stochastic Algorithm for Parametric Sensitivity in Smoluchowski's Coagulation Equation
Abstract. In this article a stochastic particle system approximation to the parametric sensitivity in the Smoluchowski coagulation equation is introduced. The parametric sensitivit...
Ismaël F. Bailleul, Peter L. W. Man, Markus K...
ACL
2006
13 years 10 months ago
Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
Elliot Glaysher, Dan I. Moldovan