Sciweavers

1023 search results - page 55 / 205
» Graph model selection using maximum likelihood
Sort
View
ECCV
2008
Springer
14 years 10 months ago
Regular Texture Analysis as Statistical Model Selection
An approach to the analysis of images of regular texture is proposed in which lattice hypotheses are used to define statistical models. These models are then compared in terms of t...
Junwei Han, Stephen J. McKenna, Ruixuan Wang
QRE
2008
140views more  QRE 2008»
13 years 8 months ago
Discrete mixtures of kernels for Kriging-based optimization
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
David Ginsbourger, Céline Helbert, Laurent ...
EMNLP
2010
13 years 6 months ago
Maximum Entropy Based Phrase Reordering for Hierarchical Phrase-Based Translation
Hierarchical phrase-based (HPB) translation provides a powerful mechanism to capture both short and long distance phrase reorderings. However, the phrase reorderings lack of conte...
Zhongjun He, Yao Meng, Hao Yu
QSHINE
2005
IEEE
14 years 2 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
DAC
2000
ACM
14 years 9 months ago
The use of carry-save representation in joint module selection and retiming
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
Zhan Yu, Kei-Yong Khoo, Alan N. Willson Jr.