Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering videos and using video clusters to present content. One method includes generating target video-specific clusters of co-watched videos for target videos, according to keywords for each target video, and storing data associating the target video with its clusters. The clusters can then be used in various applications, including identifying related videos, augmenting video search results, re-ordering video search results, and identifying content for a target video.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing video searches using query-independent quality scores.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a resource's reachability score. In one aspect, a method includes identifying one or more secondary resources reachable through one or more links of a primary resource wherein the secondary resources are within a number of hops from the primary resource; determining an aggregate score for the primary resource based on respective scores of the secondary resources wherein each one of the respective scores is calculated based on prior user interactions with a respective secondary resource; and providing the aggregate score as an input signal to a resource ranking process for the primary resource when the primary resource is represented as a search result responsive to a query.

Abstract: Obtaining search results responsive to a query, each search result identifying a respective resource and each resource having a respective rank determined by a primary ranking algorithm. The method includes obtaining primary user feedback data and secondary user feedback data for the resource. The primary and secondary user feedback data representing previous user interactions with the resource when the resource was presented as a search result responsive to the query. The method also includes applying a weight to the secondary user feedback data, the weight being at least partially based on a threshold quantity of the primary user feedback data. The method also includes aggregating the primary user feedback data and the weighted secondary user feedback data and modifying the respective rank of the resource as a search result for the query based at least partially on the aggregated data.

Abstract: The present invention provides methods and computer program products for identifying a set of related videos for a first video. An embodiment of the method comprises a video hosting website creating an ordered list containing a plurality of words from the metadata associated with the first video. The video hosting website uses a select number of words from the ordered list to form a search query. The search query is processed by the videos hosting website to obtain search results that contain a number of related videos. If the number of related videos in the search results is not within a set range, the search query is modified and the modified search query is processed. If the number of related videos in the search results is within a set range, the search results are provided as the set of related videos for the first video.

Abstract: Methods and systems to locate related digital content items in a content access log. In one embodiment, the method comprises extracting user events from a content access log, tagging each event as positive or negative, determining if a content item is positively interacted and processing the tagged items in a sliding window to determine positive interactions between a pair of content items.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a resource's reachability score. In one aspect, a method includes identifying one or more secondary resources reachable through one or more links of a primary resource wherein the secondary resources are within a number of hops from the primary resource; determining an aggregate score for the primary resource based on respective scores of the secondary resources wherein each one of the respective scores is calculated based on prior user interactions with a respective secondary resource; and providing the aggregate score as an input signal to a resource ranking process for the primary resource when the primary resource is represented as a search result responsive to a query.

Abstract: Methods and systems to locate related digital content items in a content access log. In one embodiment, the method comprises extracting user events from a content access log, tagging each event as positive or negative, determining if a content item is positively interacted and processing the tagged items in a sliding window to determine positive interactions between a pair of content items.

Abstract: The present invention provides methods and computer program products for identifying a set of related videos for a first video. An embodiment of the method comprises a video hosting website creating an ordered list containing a plurality of words from the metadata associated with the first video. The video hosting website uses a select number of words from the ordered list to form a search query. The search query is processed by the videos hosting website to obtain search results that contain a number of related videos. If the number of related videos in the search results is not within a set range, the search query is modified and the modified search query is processed. If the number of related videos in the search results is within a set range, the search results are provided as the set of related videos for the first video.

Abstract: A heap may be marked and compacted while performing only two passes over the objects and object references in the heap. Specifically, objects and object references are traversed once during a marking phase and again during a compaction phase of split-reference, two-pass mark-compaction. Object references are updated in two steps. First, during marking, each object reference may be updated to include the relative offset within its block of the referenced object and-during compaction that offset may be added to the block's destination address resulting in a reference that points to the actual post-compaction location for the referenced object. Objects of a particular block may be rearranged, or permuted, with respect to each other within the block. However, the order between groups of objects in different blocks may be preserved across compaction.

Abstract: An invention is provided for reducing cache conflict misses via specific placement of non-split functions and data objects in main memory based on cache size. A cache size of a computer cache memory is determined, and a first data block is placed within a main computer memory. The first data block includes a first sub-block that will be frequently referenced. In addition, the first sub-block ends at a first ending address. A second data block is then placed within the main computer memory. The second data block includes a second sub-block that will be frequently referenced, and is placed such that the second sub-block will be contiguous with the first sub-block in the computer cache memory during execution.

Abstract: Methods and apparatus for creating compressed versions of regular objects are disclosed. According to one aspect of the present invention, a method for creating a compressed version of an object that stores a first representation of a set of data on a heap structure of an object-based computing system includes determining when the first representation of the set of data is suitable for compression. If the first representation of the set of data is compressible, it is compressed to form a second representation of the set of data, and a second portion of memory is allocated on the heap structure. The second portion of memory is substantially smaller than a first portion of memory occupied by the object. Finally, the method includes writing the second representation of the set of data into the allocated second portion of memory. In one embodiment, the method includes resetting a pointer that identifies the object to identify the allocated second portion of memory, and removing the object from the heap structure.

Abstract: Methods and apparatus for creating a mechanism for rearranging a plurality of objects in memory are disclosed. A frequency of accesses in memory of one or more fields associated with the plurality of objects with respect to one another during execution of a computer application are determined. A mechanism for rearranging the plurality of objects in the memory in accordance with the determined frequency of accesses in memory of data referenced by the one or more fields associated with the plurality of objects with respect to one another is then generated.

Abstract: An invention is provided for reducing cache conflict misses via specific placement of non-split functions and data objects in main memory based on cache size. A cache size of a computer cache memory is determined, and a first data block is placed within a main computer memory. The first data block includes a first sub-block that will be frequently referenced. In addition, the first sub-block ends at a first ending address. A second data block is then placed within the main computer memory. The second data block includes a second sub-block that will be frequently referenced, and is placed such that the second sub-block will be contiguous with the first sub-block in the computer cache memory during execution.

Abstract: Methods and apparatus for speculatively locking an object are disclosed. According to one aspect of the present invention, a method for acquiring use of an object using a current thread includes a determination of whether a first bit included in the object is set to indicate that the object is speculatively owned by a speculative owner thread. When the object is speculatively owned, the speculative owner thread is allowed to use the object without locking the object. The method also includes checking a stored identifier that is associated with the object and identifies the speculative owner thread, as well as determining whether the stored identifier identifies the current thread. When the stored identifier identifies the current thread, the current thread already has use of the object; i.e., the current thread is the speculative owner thread.

Abstract: A method and that display certain aspects of a computer memory on a display screen in accordance with a fractal curve. In at least one embodiment, the fractal curve is a Hilbert curve. The fractal curve display can be used as an aid in visualizing various types of information about a computer memory. Certain embodiments have a display that remains static, while other embodiments have a display that is dynamic and changes in real-time to reflect changes in memory.

Abstract: A method and apparatus for generating code using parameterized classes which is compatible with an existing class library that was previously generated using unparameterized classes is disclosed. According to the method, parameterized source code is received that contains variables that belong to a plurality of types which are defined by supplying parameter values to a parameterized class definition. Static type checking is performed on the parameterized source code to determine if any incompatible type assignments exist between variables that belong to the plurality of types and values assigned to the variables. If no incompatible type assignments exist, then a homogeneous translation is performed on the parameterized source code to generate unparameterized class code. The unparameterized class code is then compiled to produce code that is compatible with the existing class library that was generated using unparameterized classes.