Nikhil Gupta

US Patent:

7756866, Jul 13, 2010

Filed:

Aug 17, 2005

Appl. No.:

11/206426

Inventors:

Gaurav Bhalotia - Mountain View CA, US
Amit Ganesh - San Jose CA, US
Nikhil Gupta - San Mateo CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707723, 707724, 707725, 707732, 707748

Abstract:

One embodiment of the present invention provides a system that facilitates automatically organizing digital images using metadata which is embedded in the digital images. The system operates by receiving a digital image with embedded metadata, wherein the embedded metadata includes Global Positioning System (GPS) data. The system uses the embedded metadata, including the GPS data, to identify additional metadata associated with the digital image. The system then saves the digital image on a storage medium. In addition, the system saves the embedded metadata and the additional metadata on the storage medium in a searchable format.

US Patent:

20210303471, Sep 30, 2021

Filed:

Mar 27, 2020

Appl. No.:

16/832893

Inventors:

- Cupertino CA, US
Tyler J. Huberty - Sunnyvale CA, US
Nikhil Gupta - Santa Clara CA, US

International Classification:

G06F 12/0862

Abstract:

In an embodiment, a processor includes a plurality of prefetch circuits configured to prefetch data into a data cache. A primary prefetch circuit may be configured to generate first prefetch requests in response to a demand access, and may be configured to invoke a second prefetch circuit in response to the demand access. The second prefetch circuit may implement a different prefetch mechanism than the first prefetch circuit. If the second prefetch circuit reaches a threshold confidence level in prefetching for the demand access, the second prefetch circuit may communicate an indication to the primary prefetch circuit. The primary prefetch circuit may reduce a number of prefetch requests generated for the demand access responsive to the communication from the second prefetch circuit.

US Patent:

20200394039, Dec 17, 2020

Filed:

Jun 11, 2019

Appl. No.:

16/437739

Inventors:

- Cupertino CA, US
Mridul Agarawal - Sunnyvale CA, US
Nikhil Gupta - Santa Clara CA, US

International Classification:

G06F 9/30
G06F 9/38

Abstract:

In an embodiment, a processor includes a load/store unit that executes load/store operations. The load/store unit may implement a two-level load queue. One of the load queues, referred to as a load retirement queue (LRQ), may track load operations from initial execution to retirement. Ordering constraints may be enforced using the LRQ. The other load queue, referred to as a load execution queue (LEQ), may track loads from initial execution to forwarding of data. Replay may be managed by the LEQ. In an embodiment, the LEQ may be smaller than the LRQ, which may permit the management of replay while still meeting timing requirements. Additionally, the larger LRQ may permit more load operations to be pending (not retired) in the processor, widening the window for out of order execution and supporting potentially higher processor performance.

US Patent:

20180174219, Jun 21, 2018

Filed:

Dec 20, 2016

Appl. No.:

15/384504

Inventors:

- Menlo Park CA, US
Shashikant Khandelwal - Mountain View CA, US
Gurpreetsingh Baljeetsingh Sachdev - Fremont CA, US
Nikhil Gupta - Palo Alto CA, US

International Classification:

G06Q 30/06
G06Q 50/00
G06Q 30/02
G06F 17/30

Abstract:

In one embodiment, a method includes receiving a set of normalized attribute values that define a particular item being offered and a corresponding threshold score for each of the normalized attribute values. The method further includes, for each attribute value of a candidate item listing, determining a score for the attribute value based on whether it matches a corresponding normalized attribute value, and determining whether the score is above or below the corresponding threshold score for the normalized attribute value. The method still further includes determining whether the candidate item listing describes the particular item being offered based on a set of rules that define an acceptable number of scores that are allowed to be below the threshold scores.

US Patent:

20180174220, Jun 21, 2018

Filed:

Dec 20, 2016

Appl. No.:

15/384527

Inventors:

- Menlo Park CA, US
Shashikant Khandelwal - Mountain View CA, US
Gurpreetsingh Baljeetsingh Sachdev - Fremont CA, US
Nikhil Gupta - Palo Alto CA, US

International Classification:

G06Q 30/06
G06Q 50/00
G06F 17/30

Abstract:

In one embodiment, a method includes receiving a plurality of candidate offers that are likely associated with a product being offered for sale. Each candidate offer is associated with a common set of attributes, wherein at least one of the attributes in the common set uniquely identifies the product being offered for sale. The method further includes, for each attribute value of each candidate offer, scoring the attribute value based on an aggregate number of times that the attribute value is found across corresponding attributes of other candidate offers in the plurality, and adding the scores for a first pair of attributes to determine a cumulative score for the candidate offer. One of the attributes in the first pair is the at least one attribute that uniquely identifies the product. The method still further includes updating a set of normalized attribute values for the product to include the attribute values for the first pair of attributes from a highest scoring candidate offer.

US Patent:

20180165740, Jun 14, 2018

Filed:

Dec 14, 2016

Appl. No.:

15/378415

Inventors:

- Menlo Park CA, US
Shashikant Khandelwal - Mountain View CA, US
Gurpreetsingh Baljeetsingh Sachdev - Fremont CA, US
Nikhil Gupta - Palo Alto CA, US

International Classification:

G06Q 30/06
G06F 17/30

Abstract:

In one embodiment, a method includes generating a query based on a seed product offer that describes a product being offered for sale and executing the query, using a search engine that normalizes search terms in the query, on a plurality of product offers to determine candidate offers. The candidate offers are likely associated with the product. The method further includes determining one or more common attribute values across corresponding attributes of the candidate offers. The method additionally includes for each attribute value of each candidate offer, scoring the attribute value based on whether it matches one or more of the common attribute values, and updating a set of normalized attribute values for the product to include the attribute value based on whether the score is greater than a predetermined threshold.

US Patent:

20170345075, Nov 30, 2017

Filed:

May 27, 2016

Appl. No.:

15/166869

Inventors:

- Menlo Park CA, US
Gurpreetsingh Baljeetsingh Sachdev - Fremont CA, US
Nikhil Gupta - Palo Alto CA, US

International Classification:

G06Q 30/06
G06Q 50/00
G06N 99/00

Abstract:

In one embodiment, a method includes extracting a document object model (DOM) for a content page, wherein the DOM comprises a hierarchical tree-based data structure. The method also includes identifying candidate nodes in the DOM based on a context of the nodes, wherein the candidate nodes may correspond to listing items. The method additionally includes for each of the candidate nodes, locating its parent and child nodes by traversing the DOM from the candidate node, extracting information from the candidate node and its parent and child nodes, and assessing whether the candidate node qualifies as a listing item based on whether the extracted information fulfills a required set of characteristics for a listing item.

US Patent:

20170330262, Nov 16, 2017

Filed:

Aug 2, 2017

Appl. No.:

15/667580

Inventors:

- Menlo Park CA, US
Shashikant Khandelwal - Mountain View CA, US
Nikhil Gupta - Palo Alto CA, US
Gurpreetsingh Sachdev - Mountain View CA, US

International Classification:

G06Q 30/06
G06F 17/30
G06Q 30/02
G06Q 30/06

Abstract:

Systems and methods for ranking one or more products in online shopping. One or more products are identified based on a search query received from user. The one or more products are ranked based on terms present in the search query. Each of the one or more products has one or more attributes associated with it. An attribute score for each of the one or more products is determined. Further, based on the attribute score, the relevancy of the one or more products is determined. Based on the relevancy, a marginal relevancy score for each of the one or more products is determined. The one or more products are re-ranked based on the marginal relevancy score. The rank of the one or more products can also be modified to optimize revenue generation.