Sciweavers

438 search results - page 29 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
SIGIR
2003
ACM
14 years 20 days ago
Collaborative filtering via gaussian probabilistic latent semantic analysis
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this ...
Thomas Hofmann
COLING
2010
13 years 2 months ago
A comparison of unsupervised methods for Part-of-Speech Tagging in Chinese
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...
Alex Cheng, Fei Xia, Jianfeng Gao
CVPR
2008
IEEE
14 years 9 months ago
Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 8 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi