Sciweavers

9359 search results - page 101 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
MOC
2002
118views more  MOC 2002»
15 years 3 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
126
Voted
CIKM
2008
Springer
15 years 6 months ago
An extension of PLSA for document clustering
In this paper we propose an extension of the PLSA model in which an extra latent variable allows the model to cocluster documents and terms simultaneously. We show on three datase...
Young-Min Kim, Jean-François Pessiot, Massi...
PODC
2006
ACM
15 years 10 months ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
133
Voted
CVPR
2007
IEEE
16 years 6 months ago
Variational Bayes Based Approach to Robust Subspace Learning
This paper presents a new algorithm for the problem of robust subspace learning (RSL), i.e., the estimation of linear subspace parameters from a set of data points in the presence...
Takayuki Okatani, Koichiro Deguchi
109
Voted
WWW
2009
ACM
16 years 4 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles