Sciweavers

1469 search results - page 195 / 294
» Approximate polynomial decomposition
Sort
View
TASLP
2008
134views more  TASLP 2008»
15 years 6 months ago
Semantic Role Labeling Using a Grammar-Driven Convolution Tree Kernel
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
Min Zhang, Wanxiang Che, Guodong Zhou, AiTi Aw, Ch...
IPL
2010
114views more  IPL 2010»
15 years 4 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
PVLDB
2010
97views more  PVLDB 2010»
15 years 4 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
MOC
2011
15 years 1 months ago
Analysis of HDG methods for Stokes flow
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
Bernardo Cockburn, Jayadeep Gopalakrishnan, Ngoc C...
SIAMNUM
2010
150views more  SIAMNUM 2010»
15 years 1 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto