Sciweavers

1322 search results - page 119 / 265
» Parameterized counting problems
Sort
View
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 10 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...
BMCBI
2005
94views more  BMCBI 2005»
13 years 10 months ago
Workflows in bioinformatics: meta-analysis and prototype implementation of a workflow generator
Background: Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflo...
Alexander García Castro, Samuel Thoraval, L...
ICFEM
2010
Springer
13 years 8 months ago
Automating Cut-off for Multi-parameterized Systems
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
Youssef Hanna, David Samuelson, Samik Basu, Hrides...
NAACL
2010
13 years 8 months ago
Improved Models of Distortion Cost for Statistical Machine Translation
The distortion cost function used in Mosesstyle machine translation systems has two flaws. First, it does not estimate the future cost of known required moves, thus increasing sea...
Spence Green, Michel Galley, Christopher D. Mannin...
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar