Sciweavers

134 search results - page 23 / 27
» Local Minimax Learning of Approximately Polynomial Functions
Sort
View
ICML
2009
IEEE
14 years 2 months ago
Sparse higher order conditional random fields for improved sequence labeling
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
Xian Qian, Xiaoqian Jiang, Qi Zhang, Xuanjing Huan...
NIPS
1998
13 years 8 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 7 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
SMA
2005
ACM
201views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Fast and robust detection of crest lines on meshes
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...