Sciweavers

4894 search results - page 702 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
ICASSP
2010
IEEE
13 years 8 months ago
Kronecker product matrices for compressive sensing
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
Marco F. Duarte, Richard G. Baraniuk
CGF
2010
135views more  CGF 2010»
13 years 8 months ago
Designing Quad-dominant Meshes with Planar Faces
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...
CGF
2008
118views more  CGF 2008»
13 years 8 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...
CGF
2008
110views more  CGF 2008»
13 years 8 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...