Sciweavers

882 search results - page 93 / 177
» On self-embeddings of computable linear orderings
Sort
View
JMLR
2010
129views more  JMLR 2010»
14 years 4 months ago
Expectation Truncation and the Benefits of Preselection In Training Generative Models
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
Jörg Lücke, Julian Eggert
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
AI
2002
Springer
14 years 9 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
PVLDB
2011
14 years 24 days ago
An Incremental Hausdorff Distance Calculation Algorithm
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
Sarana Nutanong, Edwin H. Jacox, Hanan Samet
ICASSP
2009
IEEE
15 years 4 months ago
Applying improved spectral modeling for High Quality voice conversion
In this work, accurate spectral envelope estimation is applied to Voice Conversion in order to achieve High-Quality timbre conversion. True-Envelope based estimators allow model o...
Fernando Villavicencio, Axel Röbel, Xavier Ro...