Sciweavers

915 search results - page 31 / 183
» Proof labeling schemes
Sort
View
SIAMNUM
2010
115views more  SIAMNUM 2010»
13 years 2 months ago
Superconvergence of Discontinuous Galerkin and Local Discontinuous Galerkin Schemes for Linear Hyperbolic and Convection-Diffusi
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
Yingda Cheng, Chi-Wang Shu
NAACL
2007
13 years 9 months ago
Virtual Evidence for Training Speech Recognizers Using Partially Labeled Data
Collecting supervised training data for automatic speech recognition (ASR) systems is both time consuming and expensive. In this paper we use the notion of virtual evidence in a g...
Amarnag Subramanya, Jeff A. Bilmes
STACS
2007
Springer
14 years 2 months ago
Compact Forbidden-Set Routing
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
Bruno Courcelle, Andrew Twigg
PAMI
2008
176views more  PAMI 2008»
13 years 7 months ago
Learning Flexible Features for Conditional Random Fields
Abstract-- Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increas...
Liam Stewart, Xuming He, Richard S. Zemel
PAMI
2007
125views more  PAMI 2007»
13 years 7 months ago
Matching by Linear Programming and Successive Convexification
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
Hao Jiang, Mark S. Drew, Ze-Nian Li