Patent application number | Description | Published |
20080306938 | ELECTRONIC PUBLICATION SYSTEM - A system and method for modifying publication data in a publication system are described. An example embodiment includes receiving proposed publication data and accessing a success measurement associated with past publications within a publication system. The success measurement may indicate a measurement of success associated with the past publications. An example system and method may generate modification data to be used to modify the proposed publication data. The modification data may be based on the success measurement and proposed publication data. | 12-11-2008 |
20090012991 | SYSTEM AND METHOD FOR PROVIDING INFORMATION TAGGING IN A NETWORKED SYSTEM - A computer-implemented system and method for providing information tagging in a networked system is disclosed. The apparatus in an example embodiment includes a tag engine configured to process a database of categorized product listings; to receive a user-provided tag associated with at least one of the product listings; to retain the user-provided tag; and to serve the user-provided tag to a user viewing at least one of the product listings. | 01-08-2009 |
20120016893 | ELECTRONIC PUBLICATION SYSTEM - A system and method for modifying publication data in a publication system are described. An example embodiment includes receiving proposed publication data and accessing a success measurement associated with past publications within a publication system. The success measurement may indicate a measurement of success associated with the past publications. An example system and method may generate modification data to be used to modify the proposed publication data. The modification data may be based on the success measurement and proposed publication data. | 01-19-2012 |
20120036123 | QUERY SUGGESTION FOR E-COMMERCE SITES - Methods, articles of manufacture and a system for providing query suggestions using a query log that includes a number of user sessions. The sessions comprise training data including a sequence of a plurality of sets of queries, some of the sets of queries including query transitions followed by a purchase related event. The query log is cleaned and normalized. From the cleaned and normalized query log stationary scores and transition scores of at least some of the plurality of sets is generated. A set of query suggestions is built and similarity scores are computed for at least some of the set of query suggestions to determine whether individual ones of the at least some of the set of query suggestions meet a predetermined assurance level. Those that meet the level are included as elements of the set of query suggestions that meet the predetermined assurance level. The set of query suggestions are mixed and ranked in accordance with a user behavior sought to be optimized. | 02-09-2012 |
20140101183 | ELECTRONIC PUBLICATION SYSTEM - A system and method for modifying publication data in a publication system are described. An example embodiment includes receiving proposed publication data and accessing a success measurement associated with past publications within a publication system. The success measurement may indicate a measurement of success associated with the past publications. An example system and method may generate modification data to be used to modify the proposed publication data. The modification data may be based on the success measurement and proposed publication data. | 04-10-2014 |
20140172815 | QUERY EXPANSION CLASSIFIER FOR E-COMMERCE - A system and method of query expansion are disclosed. A query expansion source, a query expansion candidate, and feature data for the query expansion source and the query expansion candidate are received. The feature data comprises information for a plurality of features. A determination is made as to whether the query expansion candidate qualifies as an expansion of the query expansion source based on an analysis of the information for the plurality of features. The query expansion candidate is assigned as an expanded query of the query expansion source in a query expansion dictionary in response to a determination that the query expansion candidate qualifies as an expansion of the query expansion source. | 06-19-2014 |
20140181136 | VIEW ITEM RELATED SEARCHES - A system and method of providing related search queries are disclosed. A new item listing is identified based on a determination that the new item listing lacks a predetermined minimum amount of clickstream data. Similar item listings for the new item listing is determined from a plurality of old item listings based on at least one item feature of the new item listing and the plurality of old item listings. The plurality of old item listings comprises live item listings and completed item listings. Each old item listing has at least the predetermined minimum amount of clickstream data. Related search queries of the similar item listings are associated with the new item listing. The related search queries for the new item listing are provided along with the new item listing to a user on a client device. | 06-26-2014 |
20150039606 | SEARCH PHRASE MODIFICATION - A user may submit a search string to a system. Before processing the search, the system may analyze the search string and modify it. For example, the search string may be modified by treating some terms as a phrase, by dropping some terms, by treating some terms as attributes, or any suitable combination thereof. The modification of the search string may be based on an analysis of prior search strings and user actions. The results of a search based on the modified search string may be returned to the user. | 02-05-2015 |
20150088895 | METHOD AND SYSTEM FOR CATEGORIZING ITEMS AUTOMATICALLY - A method and system to automatically categorize a merchant listing in an electronic marketplace are provided. The method includes parsing the category information submitted by a seller to derive a first category identifier. A first search is performed to locate the first category identifier in a first database containing a listing of category identifiers. If no match is found, the first category identifier is identified as expired or invalid. A second search is performed on a second database that includes mapping information of an expired category identifier to a new category identifier. If a match is found, the first category identifier is assigned as the new category identifier, thereby enabling the listing to be listed in the updated category automatically. | 03-26-2015 |
Patent application number | Description | Published |
20100240501 | JUMP ROPE SIMULATOR - A jump rope simulator for aerobic and anaerobic exercise having a hand-held unit comprising a handle, a base length connected to the handle, and one or more concatenated extension lengths attached to the base length. To exercise, the user grasps one or two units, imitates the motions of swinging a conventional jump rope, and jumps up and down, but there is no risk to the user of tripping over a rope as with a conventional jump rope. If the user desires, two units may also be linked together with an easily attachable connector to form a device similar to a conventional jump rope. A user can quickly convert between the two configurations of the jump rope simulator. | 09-23-2010 |
20130087275 | TAPE DISPENSER - A tape dispenser includes a first arm, a second arm, a holder, a roller, a retaining device, a blade, spring(s) and one or more guides. The tape dispenser is positioned on a tape roll by positioning the holder on the inside of the tape roll and positioning the roller and retaining device on the outside of the tape roll. Tape is able to be pulled through the tape dispenser and then cut using the blade. After the tape is cut, the tape on the roll remains on the retaining device for easy access. The tape dispenser is also removable for use with many tape rolls. | 04-11-2013 |
Patent application number | Description | Published |
20090079747 | Distributed Antialiasing In A Multiprocessor Graphics System - Multiprocessor graphics systems support distributed antialiasing. In one embodiment, two (or more) graphics processors each render a version of the same image, with a difference in the sampling location (or locations) used for each pixel. A display head combines corresponding pixels generated by different graphics processors to produce an antialiased image. This distributed antialiasing technique can be scaled to any number of graphics processors. | 03-26-2009 |
20090085928 | ANTIALIASING USING MULTIPLE DISPLAY HEADS OF A GRAPHICS PROCESSOR - Multiple display heads of a single graphics processor are exploited to perform antialiasing and other processing tasks. In one embodiment, two display heads of the same graphics processor are coupled to each other in a master/slave configuration via a pixel transfer path. The “master” display head receives pixels from the “slave” display head in addition to its own pixels, and pixel selection logic in the master display head can blend the two pixels or select either one to the exclusion of the other. If the two pixels correspond to different sampling locations in the same display pixel, the blended pixel is an antialiased pixel. | 04-02-2009 |
20090189908 | Display Balance / Metering - Method, apparatuses, and systems are presented for processing a sequence of images for display using a display device involving operating a plurality of graphics devices, including at least one first graphics device that processes certain ones of the sequence of images, including a first image, and at least one second graphics device that processes certain other ones of the sequence of images, including a second image, delaying processing of the second image by the at least one second graphics device, by a specified duration, relative to processing of the first image by the at least one first graphics device, to stagger pixel data output for the first image and pixel data output for the second image, and selectively providing output from the at least one first graphics device and the at least one second graphics device to the display device. | 07-30-2009 |
20090273603 | DETECTING CONNECTION TOPOLOGY IN A MULTI PROCESSOR GRAPHICS SYSTEM - Multiple graphics processors in a graphics processing system are interconnected in a unidirectional or bidirectional ring topology, allowing pixels to transferred from any one graphics processor to any other graphics processor. The system can automatically identify one or more “master” graphics processors to which one or more monitors are connected and configures the links of the ring such that one or more other graphics processors can deliver pixels to the master graphics processor, facilitating distributed rendering operations. The system can also automatically detect the connections or lack thereof between the graphics processors. | 11-05-2009 |
20110090232 | GRAPHICS PROCESSING SYSTEMS WITH MULTIPLE PROCESSORS CONNECTED IN A RING TOPOLOGY - Multiple graphics processors in a graphics processing system are interconnected in a unidirectional or bidirectional ring topology, allowing pixels to transferred from any one graphics processor to any other graphics processor. The system can automatically identify one or more “master” graphics processors to which one or more monitors are connected and configures the links of the ring such that one or more other graphics processors can deliver pixels to the master graphics processor, facilitating distributed rendering operations. The system can also automatically detect the connections or lack thereof between the graphics processors. | 04-21-2011 |
20110102448 | VERTEX ATTRIBUTE BUFFER FOR INLINE IMMEDIATE ATTRIBUTES AND CONSTANTS - One embodiment of the present invention sets forth a technique for providing primitives and vertex attributes to the graphics pipeline. A primitive distribution unit constructs the batches of primitives and writes inline attributes and constants to a vertex attribute buffer (VAB) rather than passing the inline attributes directly to the graphics pipeline. A batch includes indices to attributes, where the attributes for each vertex are stored in a different VAB. The same VAB may be referenced by all of the vertices in a batch or different VABs may be referenced by different vertices in one or more batches. The batches are routed to the different processing engines in the graphics pipeline and each of the processing engines reads the VABs as needed to process the primitives. The number of parallel processing engines may be changed without changing the width or speed of the interconnect used to write the VABs. | 05-05-2011 |
20130124838 | INSTRUCTION LEVEL EXECUTION PREEMPTION - One embodiment of the present invention sets forth a technique instruction level and compute thread array granularity execution preemption. Preempting at the instruction level does not require any draining of the processing pipeline. No new instructions are issued and the context state is unloaded from the processing pipeline. When preemption is performed at a compute thread array boundary, the amount of context state to be stored is reduced because execution units within the processing pipeline complete execution of in-flight instructions and become idle. If, the amount of time needed to complete execution of the in-flight instructions exceeds a threshold, then the preemption may dynamically change to be performed at the instruction level instead of at compute thread array granularity. | 05-16-2013 |
20130132711 | COMPUTE THREAD ARRAY GRANULARITY EXECUTION PREEMPTION - One embodiment of the present invention sets forth a technique instruction level and compute thread array granularity execution preemption. Preempting at the instruction level does not require any draining of the processing pipeline. No new instructions are issued and the context state is unloaded from the processing pipeline. When preemption is performed at a compute thread array boundary, the amount of context state to be stored is reduced because execution units within the processing pipeline complete execution of in-flight instructions and become idle. If, the amount of time needed to complete execution of the in-flight instructions exceeds a threshold, then the preemption may dynamically change to be performed at the instruction level instead of at compute thread array granularity. | 05-23-2013 |
20140095759 | REPLICATED STATELESS COPY ENGINE - Techniques are disclosed for performing an auxiliary operation via a compute engine associated with a host computing device. The method includes determining that the auxiliary operation is directed to the compute engine, and determining that the auxiliary operation is associated with a first context comprising a first set of state parameters. The method further includes determining a first subset of state parameters related to the auxiliary operation based on the first set of state parameters. The method further includes transmitting the first subset of state parameters to the compute engine, and transmitting the auxiliary operation to the compute engine. One advantage of the disclosed technique is that surface area and power consumption are reduced within the processor by utilizing copy engines that have no context switching capability. | 04-03-2014 |