Johns Hopkins University

Emc Corporation

Disney Enterprises, Inc.

Brown University

Michael Truman Goodrich

Roberto Tamassia

Nikolaos Triandopoulos

Yair Amir

Rasmus Tamstorf

John Lane Schultz

Charalampos Papamanthou

Cristina Videira Lopes

Jacob William Green

Olga Ohrimenko

David Eppstein

Duy Nguyen

An improved search engine technique allows a user to ensure that an untrusted search engine provides complete and correct search results without requiring large proofs for large data collections. Thus techniques are presented for a trusted crawler to index a distributed collection of documents and create an authenticated search structure that allows an untrusted search server to return reliably complete and correct search results.

Techniques for verifying search results over a distributed collection

A method for automatically transferring attributes between computer-generated models. The method includes storing in memory first and second models represented by polygonal meshes and storing a set of attributes for the first model. A processor operates or runs a compressed graph generator to process the first and second models to generate first and second compressed graphs that are compressed versions of the models. The method includes comparing topological connectivity of the first and second compressed graphs. When the connectivity is similar, the method includes transferring at least a portion of the attributes from the first model to the second model. The compressed graphs may be motorcycle graphs, skeleton graphs, or other forms of compressed graphs. The method includes determining a pair of vertices in the first compressed graph that match vertices in the second compressed graph for use as starting locations in comparing topological connectivity of the compressed graphs.

Attribute transfer between computer models including identifying isomorphic regions in polygonal meshes

A system for maximal gathering of fresh information added to a network such as the as the Internet and for processing the gathered fresh information. A link server () sends a batch of links to check () to a crawler (B). Crawler (B) them executes its crawling assignment by filtering the encountered content and extracting only that which is new or changed (). Crawler (B) then returns this content () to at least one data center and any interested web mining application (). By using the crawlers (A-E) to filter the data and only return or notify regarding, the fresh content, less bandwidth is needed to get the information to the web mining application ().

High refresh-rate retrieval of freshly published content using distributed crawling

An efficient and practical method for dynamically maintaining an authenticated dictionary uses a skip list data structure and communicative hash functions to provide a dictionary database () that stores information objects so that any individual object can be authenticated as belonging or not belonging to the dictionary. The authentication consists of a short sequence of vales that begin with an element and a sequence of values that, when hashed in order using a cryptographic associative hash function, create the same value as the hashed digest of the entire dictionary. Rather than hashing up a dynamic 2-3 tree, hashes are created in a skip list. Validation of the result of the authenticating step is provided if the hash of the short sequence matches a signed hash of the entire skip list.

Efficient authenticated dictionaries with skip lists and commutative hashing

Growing community of inventors

Irvine, CA, United States of America

Michael Truman Goodrich