824 search results - page 34 / 165 » Weighted Low-Rank Approximations |
ECIR
2004
Springer
13 years 10 months ago
2004
Springer
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
ICASSP
2009
IEEE
13 years 6 months ago
2009
IEEE
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
EMNLP
2006
13 years 10 months ago
2006
Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Inde...
TALG
2010
13 years 6 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...