561 search results - page 57 / 113 » Algorithms and applications for approximate nonnegative matr... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Document understanding techniques such as document clustering and multi-document summarization have been receiving much attention in recent years. Current document clustering meth...