9849 search results - page 328 / 1970 » Algorithms and Experiments for the Webgraph |
136
click to vote
COLING
2010
15 years 2 months ago
2010
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...
212
click to vote
TASLP
2011
15 years 2 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
168
click to vote
JMLR
2010
15 years 2 months ago
2010
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
208
click to vote
JMLR
2010
15 years 2 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
224
click to vote
ML
2010
ACM
15 years 2 months ago
2010
ACM
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...