Sciweavers

2477 search results - page 26 / 496
» Approximate extended formulations
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
BMCBI
2006
117views more  BMCBI 2006»
13 years 7 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
MOC
1998
95views more  MOC 1998»
13 years 7 months ago
The Trotter-Kato theorem and approximation of PDEs
Abstract. We present formulations of the Trotter-Kato theorem for approximation of linear C0-semigroups which provide very useful framework when convergence of numerical approximat...
Kazufumi Ito, Franz Kappel
TC
2008
13 years 7 months ago
Efficient Approximate Wordlength Optimization
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
Paul D. Fiore