3 ms·
Yeah, this is patently (ha) absurd. I can't think of an algorithm off the top of my head that isn't feasible to do manually for small values of n.
by skorgu 15y ago
Yeah, this is patently (ha) absurd. I can't think of an algorithm off the top of my head that isn't feasible to do manually for small values of n.
- wisty 15y agoThe question is, will doing them for small values of n solve the problem? Page rank may be more or less useless with a small data set.
- skorgu 15y agoIt would provide the correct result of the algorithm which should be enough. Useful is outside the scope of patents (AIUI, IANAL).
- wisty 15y agoI think whole point of patents is they are a registered solution to a problem. So I think usefulness is within their scope. But IANAL either.
- skorgu 15y agoIt's not usefulness as we know it: http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=6293874.PN.&OS=PN/6293874&RS=PN/6293874 http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sec...
- bartonfink 15y agoActually, utility is one of the core requirements for a patent in the U.S. Whether or not PageRank on a tiny data set is still "useful" would be a ? for the patent office, but if it were deemed not useful, that would be grounds for denial.