Niantic, Inc.

Quid Inc.

David Grayson Smith

Ruggero Altair Tacchi

Si Ying Diana Hu

Peter James Turner

Gandeevan Raghuraman

Benjamin Peake

Diana Hu Si Ying

Processing of actions within a shared augmented reality experience is split between an edge node of a communications network (e.g., a cell tower) and a server. As a result, computation of the current state may be sharded naturally based on real-world location, with state updates generally provided by the edge node and the server providing conflict resolution based on a master state (e.g., where actions connected to different edge nodes potentially interfere with each other). In this way, latency may be reduced as game actions are communicated between clients connected to the same edge node using a peer-to-peer (P2P) protocol without routing the actions via the game server.

Augmented reality mobile edge computing

Provided is a process including: sampling of nodes of a first graph; and forming a second graph comprising nodes, each of which corresponds to at least one entity mentioned in unstructured text documents. Forming the second graph comprises, for each pair of the nodes of the second graph, setting a relationship between the pair, the pair comprising (i) a first node corresponding to a first entity and (ii) a second node corresponding to a second entity, by: identifying, in the first graph, a node corresponding to an unstructured text document in which the first entity is mentioned; and setting the relationship between the pair based on a determination of whether or which of the sampled nodes comprises a node satisfying a set of criteria, the criteria comprising (i) having a relationship with the identified node and (ii) corresponding to an unstructured text document in which the second entity is mentioned.

Pivoting from a graph of semantic similarity of documents to a derivative graph of relationships between entities mentioned in the documents

Provided is a process including: obtaining a first graph comprising nodes and edges, each of the first-graph edges linking two of the first-graph nodes and denoting semantic similarity of unstructured text in documents corresponding to the two linked first-graph nodes; for each of the first-graph nodes, selecting nodes for a second graph from attributes of the unstructured text documents to which the first-graph node corresponds, wherein the attributes are entities mentioned in the unstructured text documents, and wherein each of the second-graph nodes corresponds to a respective selected attribute; and for each pair of the second-graph nodes, determining a respective edge weight indicating similarity between a first entity corresponding to a first node of the respective pair and a second entity corresponding to a second node of the respective pair.

Growing community of inventors

San Francisco, CA, United States of America

David Grayson Smith