Sciweavers

2412 search results - page 15 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
UAI
2008
13 years 11 months ago
The Computational Complexity of Sensitivity Analysis and Parameter Tuning
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
Johan Kwisthout, Linda C. van der Gaag
ICPR
2000
IEEE
14 years 11 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes
EOR
2006
68views more  EOR 2006»
13 years 9 months ago
Modelling complex assemblies as a queueing network for lead time control
In this paper we develop an open queueing network for optimal design of multi-stage assemblies, in which each service station represents a manufacturing or assembly operation. The...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
EMNLP
2009
13 years 7 months ago
Sinuhe - Statistical Machine Translation using a Globally Trained Conditional Exponential Family Translation Model
We present a new phrase-based conditional exponential family translation model for statistical machine translation. The model operates on a feature representation in which sentenc...
Matti Kääriäinen
DAM
2010
137views more  DAM 2010»
13 years 10 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...