Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
wisty
on Aug 17, 2011
|
parent
|
context
|
favorite
| on:
Federal Circuit case renders many broadly written ...
The 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
on Aug 17, 2011
[–]
It would provide the correct result of the algorithm which should be enough. Useful is outside the scope of patents (AIUI, IANAL).
bartonfink
on Aug 17, 2011
|
parent
|
next
[–]
Actually, 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.
wisty
on Aug 17, 2011
|
parent
|
prev
[–]
I 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
on Aug 19, 2011
|
root
|
parent
[–]
It's not usefulness as we know it:
http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sec...
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
