Patents by Inventor Daniel Norin Meredith

Daniel Norin Meredith has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7966337
    Abstract: A system and method for prioritizing a fetch order of web pages. The method comprises extracting by a web crawler a set of candidate web pages to be crawled. Each web page in the set of candidate web pages is associated with a website in a computer network. A determination is made to determine if a first website score for the website is in a website score database. The first website score is associated with web pages in the set of candidate web pages if the first website score exists in the website score database. The set of candidate web pages is prioritized with respect to an associated website score for each web page in the candidate set of web pages. Content is retrieved from the set of candidate web. Hyperlinks are extracted from the content. The hyperlinks are stored in a memory unit.
    Type: Grant
    Filed: June 23, 2008
    Date of Patent: June 21, 2011
    Assignee: International Business Machines Corporation
    Inventors: David L. Blackman, Michael Ching, Stephen Dill, Ivan Eduardo Gonzalez, Adam Marcus, Daniel Norin Meredith, Linda Anh Linh Nguyen
  • Patent number: 7593940
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Grant
    Filed: May 26, 2006
    Date of Patent: September 22, 2009
    Assignee: International Business Machines Corporation
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith
  • Patent number: 7587407
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Grant
    Filed: May 26, 2006
    Date of Patent: September 8, 2009
    Assignee: International Business Machines Corporation
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith
  • Patent number: 7475069
    Abstract: A system and method for prioritizing a fetch order of web pages. The method comprises extracting by a web crawler a set of candidate web pages to be crawled. Each web page in the set of candidate web pages is associated with a website in a computer network. A determination is made to determine if a first website score for the website is in a website score database. The first website score is associated with web pages in the set of candidate web pages if the first website score exists in the website score database. The set of candidate web pages is prioritized with respect to an associated website score for each web page in the candidate set of web pages. Content is retrieved from the set of candidate web. Hyperlinks are extracted from the content. The hyperlinks are stored in a memory unit.
    Type: Grant
    Filed: March 29, 2006
    Date of Patent: January 6, 2009
    Assignee: International Business Machines Corporation
    Inventors: David L. Blackman, Michael Ching, Stephen Dill, Ivan Eduardo Gonzalez, Adam Marcus, Daniel Norin Meredith, Linda Anh Linh Nguyen
  • Publication number: 20080256046
    Abstract: A system and method for prioritizing a fetch order of web pages. The method comprises extracting by a web crawler a set of candidate web pages to be crawled. Each web page in the set of candidate web pages is associated with a website in a computer network. A determination is made to determine if a first website score for the website is in a website score database. The first website score is associated with web pages in the set of candidate web pages if the first website score exists in the website score database. The set of candidate web pages is prioritized with respect to an associated website score for each web page in the candidate set of web pages. Content is retrieved from the set of candidate web. Hyperlinks are extracted from the content. The hyperlinks are stored in a memory unit.
    Type: Application
    Filed: June 23, 2008
    Publication date: October 16, 2008
    Inventors: David L. Blackman, Michael Ching, Stephen Dill, Ivan Eduardo Gonzalez, Adam Marcus, Daniel Norin Meredith, Linda Anh Linh Nguyen
  • Publication number: 20080222146
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Application
    Filed: April 3, 2008
    Publication date: September 11, 2008
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith
  • Publication number: 20080215585
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Application
    Filed: April 2, 2008
    Publication date: September 4, 2008
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith
  • Publication number: 20070276830
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Application
    Filed: May 26, 2006
    Publication date: November 29, 2007
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith
  • Publication number: 20070276881
    Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.
    Type: Application
    Filed: May 26, 2006
    Publication date: November 29, 2007
    Inventors: Daniel Frederick Gruhl, Daniel Norin Meredith