Sciweavers

78 search results - page 2 / 16
» A choice model with infinitely many latent features
Sort
View
MOC
2002
118views more  MOC 2002»
13 years 4 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
WWW
2009
ACM
14 years 5 months ago
Latent space domain transfer between high dimensional overlapping distributions
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...
Sihong Xie, Wei Fan, Jing Peng, Olivier Verscheure...
COLING
2010
12 years 11 months ago
An Exploration of Features for Recognizing Word Emotion
Emotion words have been well used as the most obvious choice as feature in the task of textual emotion recognition and automatic emotion lexicon construction. In this work, we exp...
Changqin Quan, Fuji Ren
CRV
2008
IEEE
295views Robotics» more  CRV 2008»
13 years 11 months ago
3D Human Motion Tracking Using Dynamic Probabilistic Latent Semantic Analysis
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
Kooksang Moon, Vladimir Pavlovic
ACS
2010
13 years 4 months ago
Fibrations of Simplicial Sets
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
Tibor Beke