For resolved PHP, the uncertainty on the photon PDFs is tragic, so its not really clear if your testing pQCD or universal factorisation or what.    From Wordnik.com.  [How low is low? « Imaginary Potential] Reference

NNMF is different from SVD (or PCA) factorisation in that it factorises a positive matrix (all elements), say ‘A’ into factor matrices which are also both positives.    From Wordnik.com.  [Re-Fried Greenland Ice Cores « Climate Audit] Reference

The paper describes an online version of the popular NNMF (non-negative matrix factorisation) which trains itself in realtime, that is suited to your realtime tracking at Digg.    From Wordnik.com.  [Leaked Screen Shots Of Mythical Digg Recommendation Engine] Reference

For the unique prime factorisation theorem, we can then define all factorisations differing only by units as equivalent then say all prime factorisations are unique up to that equivalence.    From Wordnik.com.  [The Volokh Conspiracy » Yow!] Reference

Given an efficient solution to the integer factorisation problem, breaking RSA would become trivial.    From Wordnik.com.  [Citizendium, the Citizens' Compendium - Recent changes [en]] Reference

It is holomorphic everywhere except at prime ideals of the ring of integers, which formally expresses the unique factorisation of ideals into prime ideals.    From Wordnik.com.  [Citizendium, the Citizens' Compendium - Recent changes [en]] Reference

The ring of integers is an integral domain, but does not in general have the desirable factorisation properties of the ring Dedekind domain, having unique factorisation of ideals into prime ideals.    From Wordnik.com.  [Citizendium, the Citizens' Compendium - Recent changes [en]] Reference

The grounds of the subject as we know it were set in the late nineteenth century, when ideal numbers, the theory of ideals and valuation theory were developed; these are three complementary ways of dealing with the lack of unique factorisation in algebraic number fields.    From Wordnik.com.  [Citizendium, the Citizens' Compendium - Recent changes [en]] Reference

Samidh, I understand multi-document summarization really well, if fact you can use the traditional SVD (singular value decomposition), NNMF (non-negative matrix factorisation) as shown here (Multi-document Summarization Based on Cluster Using Non-negative Matrix Factorization), the HMM (hidden Markov Model) as described here (CLASSY Query-Based Multi-Document Summarization) and more.    From Wordnik.com.  [Pluribo Is CliffsNotes For Amazon Reviews] Reference

However, while no really efficient (polynomial in the number of bits in N) methods are known, there are various methods that do work (see integer factorisation), those methods are improving, and computers get faster all the time (see.    From Wordnik.com.  [Citizendium, the Citizens' Compendium - Recent changes [en]] Reference

Over-factorisation.    From Wordnik.com.  [Recently Uploaded Slideshows] Reference