Mediamind Technologies Ltd.

Sizmek Technologies, Inc.

Amichai Kidron

Ofer Zadikario

Hanit Galili

Keren Friedman

Efraeim Cohen-Kassko

Inbal Cohen-Shwartz

A method for uniquely identifying an initial exposure of a visitor to an advertisement campaign is provided. The method includes causing a web browser to call an overlap server upon serving of an advertisement of the advertisement campaign; storing, by the overlap server, an overlap data structure in any one of the web browser and a web server, wherein the overlap data structure is coded to identify the advertisement campaign, a host website through which the visitor is exposed to the advertisement campaign, and an indication as to whether the advertisement campaign was previously visited by the visitor of the web browser; and processing, by the overlap server, the overlap data structure to determine the initial exposure of the visitor to the advertisement of the advertisement campaign and the host website through which the visitor was exposed to the advertisement campaign.

Method and system for tracking a cumulative number of identifiable visitors to different objects

A method for tracking a cumulative number of unique visitors to different to objects. The method includes maintaining a data structure that allows for a direct determination of the cumulative number of different visitors exposed to the different objects; establishing a connection with a visitor when the visitor requests to visit an object; examining a cookie stored in the visitor during the established connection to determine whether the visitor previously visited the currently requested object; and updating the data structure in the database and an overlap code contained in the cookie based on the examination results, wherein objects are different websites displaying a same set of advertisements of a same campaign.

A computer-implemented method and system is provided for tracking a cumulative number of identifiable visitors to different objects (S, S. . . S), each of which may be visited by multiple visitors. A data structure is adapted to contain records relating to each object (S, S. . . S) and to each combination of two or more objects (SS, SS, . . . SS, SS, SS, . . . SS, SSS, SSS, . . . SSSetc.). For each visitor visiting an object (S) for the first time there is determined a current combination of objects previously visited by the visitor. If no objects have been previously visited by the visitor, a respective record relating to the object (S) is incremented; and if objects have been visited by the visitor, the record relating to the current combination is decremented and the record relating to the combination of the object (S) with the current combination is incremented.

Growing community of inventors

Giv′at-Shmuel, Israel

Amichai Kidron