Patents by Inventor Gopalakrishnan Krishnan

Gopalakrishnan Krishnan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8850035
    Abstract: A system, comprising a plurality of geographically distributed colocation facilities (colos), each colo comprising a plurality of computing devices configured to establish local connections between the colo and user devices associated with a corresponding set of users; maintain local connection state information relating to the local connections; maintain remote connection state information relating to remote connections between other ones of the colos and user devices associated with the corresponding sets of users; and facilitate sessions between any of the user devices connected to any of the colos with reference to the local and remote connection state information.
    Type: Grant
    Filed: May 16, 2007
    Date of Patent: September 30, 2014
    Assignee: Yahoo! Inc.
    Inventors: Rajanikanth Vemulapalli, Linlong Jiang, Manish Godara, Gopalakrishnan Krishnan, Naveen Sanjeeva
  • Publication number: 20140278916
    Abstract: In one embodiment, a method includes receiving, from an advertiser, an identification of one or more products in a catalog of the advertiser. The method may further include accessing an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node. A portion of the graph corresponds to an advertiser's product catalog. The method may further include identifying, based on the portion of the graph corresponding to the products identified by the advertiser, one or more products or product types related to the products identified by the advertiser.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Applicant: Adchemy, Inc.
    Inventors: Murthy V. Nukala, Ethan James Batraski, Alessandro Magnani, Srinidhi Ramesh Kondaji, Richard Edwin Chatwin, Siva Kumar Gorantla, Scott Harold Fish, Zuzar F. Nafar, Gopalakrishnan Krishnan, Dmitry Serenbrennikov, Seán Padraig Lightholder
  • Publication number: 20140279065
    Abstract: In one embodiment, a method includes accessing an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node. A portion of the graph corresponds to an advertiser's product catalog. The method may further include accessing an ad library that contains elements for an advertisement. The method may further include selecting at least one of the elements based on the portion of the graph corresponding to the portion of the product catalog of the advertiser. The method may further include generating an advertisement for display based on the selected elements.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Applicant: Adchemy, Inc.
    Inventors: Murthy V. Nukala, Ethan James Batraski, Alessandro Magnani, Srinidhi Ramesh Kondaji, Richard Edwin Chatwin, Siva Kumar Gorantla, Scott Harold Fish, Zuzar F. Nafar, Gopalakrishnan Krishnan, Dmitry Serenbrennikov, Seán Padraig Lightholder
  • Publication number: 20140278959
    Abstract: In one embodiment, a method includes accessing an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node. A portion of the graph corresponds to an advertiser's product catalog. The method may further include accessing one or more targeting criteria for one or more products in the portion of the product catalog. The method may further include creating at least a portion of an advertising campaign, for at least one product for which targeting criteria has been accessed, based on the targeting criteria and the portion of the graph corresponding to the portion of the product catalog.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Applicant: Adchemy, Inc.
    Inventors: Murthy V. Nukala, Ethan James Batraski, Alessandro Magnani, Srinidhi Ramesh Kondaji, Richard Edwin Chatwin, Siva Kumar Gorantla, Scott Harold Fish, Zuzar F. Nafar, Gopalakrishnan Krishnan, Dmitry Serenbrennikov, Seán Padraig Lightholder
  • Publication number: 20140278958
    Abstract: In one embodiment, a method includes creating an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Applicant: Adchemy, Inc.
    Inventors: Murthy V. Nukala, Ethan James Batraski, Alessandro Magnani, Srinidhi Ramesh Kondaji, Richard Edwin Chatwin, Siva Kumar Gorantla, Scott Harold Fish, Zuzar F. Nafar, Gopalakrishnan Krishnan, Dmitry Serenbrennikov, Seán Padraig Lightholder
  • Publication number: 20140279078
    Abstract: In one embodiment, a method includes accessing information about an advertiser's product catalog. The method may further include accessing an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node. A portion of the graph corresponds to the advertiser's product catalog. The method may further include enriching information associated with the portion of the product catalog with information related to the concepts and relationships represented by the portion of the graph corresponding to the portion of the product catalog of the advertiser.
    Type: Application
    Filed: March 17, 2014
    Publication date: September 18, 2014
    Applicant: Adchemy, Inc.
    Inventors: Murthy V. Nukala, Ethan James Batraski, Alessandro Magnani, Srinidhi Ramesh Kondaji, Richard Edwin Chatwin, Siva Kumar Gorantla, Scott Harold Fish, Zuzar F. Nafar, Gopalakrishnan Krishnan, Dmitry Serenbrennikov, Seán Padraig Lightholder
  • Publication number: 20070271482
    Abstract: A built-in self-test (BIST) circuit for testing addressable locations can include a BIST generator (202) that can generate test addresses for testing each addressable location. Defective addresses can be stored in a fault address store (216). An address range selector circuit (230) can limit the range of addresses generated by an address generator (234). Once defective addresses for a first range have been detected, an address range selector circuit (230) can test another range. An entire address range can thus be tested regardless of the depth of a fault address store (216).
    Type: Application
    Filed: March 2, 2007
    Publication date: November 22, 2007
    Inventors: Ramesha Doddamane, Eswar Vadlamani, Gopalakrishnan Krishnan, Tarjinder Singh
  • Publication number: 20070143383
    Abstract: An averaging circuit and method are provided to compute a running average over a number of samples without the need for maintaining a large sample queue or register. Generally, the method includes the steps of (i) receiving and accumulating data samples in a plurality of sample-accumulators while counting the number of samples received in a sample-counter; (ii) alternately selecting the sum of the samples accumulated in each of the sample-accumulators; (iii) dividing the sum of the samples accumulated in a selected sample-accumulator by the number of samples received to provide an average of the samples accumulated therein; and (iv) interleaving selection of the plurality of sample-accumulators and alternating reset of each to provide a running average over a number of samples.
    Type: Application
    Filed: December 16, 2005
    Publication date: June 21, 2007
    Inventors: Yansun Xu, Gopalakrishnan Krishnan
  • Publication number: 20060253752
    Abstract: A parallel data transmission test system can include a receiver section (100) having input selector circuits (104-0 to 104-N) that provide a received test data to logic adjust circuits (106-0 to 106-N) that “logically align” multiple incoming test values to remove intentionally introduced logic difference (e.g., inversion) with respect to one another. Result combining circuit (108) can logically combine output data values and provide a resulting sequence to a pattern sequence test circuit (110).
    Type: Application
    Filed: May 4, 2006
    Publication date: November 9, 2006
    Inventors: Gopalakrishnan Krishnan, Eswar Vadlamani, Tarjinder Munday
  • Publication number: 20050053544
    Abstract: The present invention relates to a novel combustion process for the preparation of LiCoVO4 useful as the cathode material in the rechargeable lithium-ion rocking chair cells by heating a composite mixture of LiNO3.3H2O, Co(NO3)2.6H2O and NH4VO3 with urea in aqueous medium to obtain LiCoVO4.
    Type: Application
    Filed: June 17, 2004
    Publication date: March 10, 2005
    Inventors: Chitra Srinivasan, Kalyani Palanichamy, Mohan Thyagarajan, Gopalakrishnan Krishnan, Gangadharan Ramaiyer, Julien Christian