1068 search results - page 90 / 214 » Factorization as a Rank 1 Problem |
APPROX
2011
Springer
13 years 10 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
111
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Many outlier detection methods do not merely provide the decision for a single data object being or not being an outlier but give also an outlier score or “outlier factor” sig...
SIGIR
2005
ACM
15 years 3 months ago
2005
ACM
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
ICDT
2005
ACM
15 years 3 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...