Facebook, Inc.

Brian Christopher Karrer

Cameron Marlow

Lars Seren Backstrom

Dean Griffin Eckles

Johan Ugander

Jon Kleinberg

Balmanohar Paluri

Vishakan Ponnampalam

Birce Tezel

Timothy Eric Danford

Nicolas Emilio Stier Moses

Ismail Onur Filiz

Guan Pang

Jing Huang

Cameron Alexander Marlow

Arun Dattaram Sharma

Alon Michael Shalita

Igor Kabiljo

Laxman Dhulipala

In one embodiment, a method includes accessing a point cloud comprising a plurality of point-cloud points, each point-cloud point corresponding to a location on a surface of an object located in a region in a three-dimensional space, identifying, from the point cloud, a plurality of point clusters, each point cluster comprising a plurality of point-cloud points located within a grid segment on a two-dimensional grid derived from the three-dimensional space, selecting, for each point cluster, a set of point-cloud points from the plurality of point-cloud points in the point cluster, the set of point-cloud points being selected based on a predetermined threshold number of point-cloud points associated with an acceptable reduction in an error detection rate, and determining, for each point cluster, a structure classification based on the selected set of point-cloud points from the point cluster.

Multi-hop wireless network plannning

In one embodiment, a method includes accessing a point cloud comprising several points, wherein each point corresponds to a location on a surface of an object located in three-dimensional space; determining whether each point in the point cloud is part of a linear structure, a planar structure, or a volumetric structure; identifying a plurality of point clusters, wherein each point cluster comprises one or more points that are located within a grid segment on a two-dimensional grid derived from the three-dimensional space; determining, for each point cluster, whether the point cluster represents a vertical-linear structure or a portion of a vertical-linear structure; identifying one or more point-cluster pairs, wherein each point-cluster pair includes two point clusters corresponding to one or more vertical-linear structures within a threshold distance in the three-dimensional space; and determining, for each point-cluster pair, whether a line-of-sight exists between each point-cluster in the point-cluster pair.

Multi-hop wireless network planning

In one embodiment, a method includes sending, from an application server to a first set of client systems, instructions for providing a treatment to a first set of users. The method includes determining an average treatment effect of the treatment for the first set of users based on information about user interactions associated with the treatment and a network exposure to the treatment for each user. Network exposure for a user is a measure of other users associated with the user that have been provided the treatment. The method includes modifying the treatment based on the determined average treatment effect. The method includes sending, to a second set of client systems, instructions for providing the modified treatment to a second set of users. The second set of users is a discrete, non-overlapping set of users with respect to the first set.

Network-aware product rollout in online social networks

Embodiments are disclosed for improving cache or memory efficiency of a social network system. A method according to some embodiments includes steps of: receiving an instruction to improve cache or memory efficiency of social graph data of a social graph; generating based on the social graph a partitioning tree including multiple bottom-level buckets, the partitioning tree dividing the vertices of the social graph into the bottom-level buckets and ordering the bottom-level buckets such that a social network metric regarding the vertices is optimized; assigning user IDs to the vertices of the social network in a numerical sequence based on the ordering of the bottom-level buckets; storing the social graph data of the users in storage locations in an order according to the numeral sequence of the assigned user IDs of the vertices.

Cache efficiency by social graph data ordering

In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each node corresponding to a user of an online social network, identifying a plurality of clusters in the social graph using graph clustering, providing a treatment to a first set of users based on the clusters, and determining a treatment effect treatment for the users in the first set based on a network exposure to the treatment for each user.

Network aware product rollout in online social networks

Growing community of inventors

Takoma Park, MD, United States of America

Brian Christopher Karrer