Patents by Inventor Yekesa Kosuru

Yekesa Kosuru 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: 10846707
    Abstract: A method and system for deploying and customizing advertisement selection logic without requiring a shutdown and/or restart of system resources. A first arrangement of advertisement logic may include filters to be executed in a pipeline model. A second arrangement of advertisement selection logic may be determined based at least in part on information received. Alternatively, the second arrangement of advertisement selection logic may be automatic based at least in part on statistics or defined hints. The second arrangement of advertisement selection logic may be implemented using different filters or rearranged filters in an updated pipeline model.
    Type: Grant
    Filed: June 27, 2008
    Date of Patent: November 24, 2020
    Assignee: Provenance Asset Group LLC
    Inventor: Yekesa Kosuru
  • Patent number: 9846735
    Abstract: An approach is provided for providing a unified extensible platform for overall probe data and storage. The approach comprises causing, at least in part, a storage of probe data in one or more information spaces, one or more namespaces of the one or more information spaces, or a combination thereof. The approach further comprises determining one or more nodes for processing the probe data based, at least in part, on one or more context criteria, the one or more nodes associated with the one or more information spaces. The approach also comprises determining to provide access to the processed probe data via the one or more information spaces, the one or more namespaces, or a combination thereof.
    Type: Grant
    Filed: April 19, 2012
    Date of Patent: December 19, 2017
    Assignee: HERE Global B.V.
    Inventors: Yekesa Kosuru, Alexey Yakubovich, Senthil Natesan, Boris Lublinsky
  • Patent number: 9305002
    Abstract: Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry.
    Type: Grant
    Filed: April 20, 2015
    Date of Patent: April 5, 2016
    Assignee: Nokia Technologies Oy
    Inventors: Mark Rambacher, Abhijit Bagri, Yekesa Kosuru
  • Patent number: 9122532
    Abstract: An approach is provided for creating a framework for executing code in nodes of a distributed storage platform. An in-node code framework receives at least one job for execution over a distributed computing platform. The in-node code framework determines at least one distributed storage platform containing at least a portion of the data for executing the at least one job. The in-node then processes and/or facilitates a processing of the at least one job to determine code for executing at one or more storage nodes of the at least one distributed storage platform, wherein the code supports the at least one job.
    Type: Grant
    Filed: April 27, 2012
    Date of Patent: September 1, 2015
    Assignee: NOKIA TECHNOLOGIES OY
    Inventors: Yekesa Kosuru, Amit Jaiswal, Abhijit Bagri
  • Publication number: 20150227538
    Abstract: Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry.
    Type: Application
    Filed: April 20, 2015
    Publication date: August 13, 2015
    Inventors: Mark RAMBACHER, Abhijit BAGRI, Yekesa KOSURU
  • Patent number: 9032053
    Abstract: An approach is provided for upgrading components of a cluster. One or more components of at least one server of a cluster of servers are determined to be upgraded. Status information of the cluster, the at least one server, or a combination thereof is determined. It is determined whether to initiate another upgrade of one or more other components of the at least one server, another one of the servers, or a combination thereof based, at least in part, on the status information.
    Type: Grant
    Filed: October 31, 2011
    Date of Patent: May 12, 2015
    Assignee: Nokia Corporation
    Inventors: Yekesa Kosuru, Anssi Juhani Alaranta
  • Patent number: 9015126
    Abstract: Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry.
    Type: Grant
    Filed: April 21, 2011
    Date of Patent: April 21, 2015
    Assignee: Nokia Corporation
    Inventors: Mark Rambacher, Abhijit Bagri, Yekesa Kosuru
  • Patent number: 8977295
    Abstract: An approach is provided for generating accurate and substantially real-time map and location-based data in a cost-effective manner. Specifically, one or more communications within one or more social networks are monitored, processed, and mined to determine map-related information (e.g., maps, traffic, points of interest). The map-related information is then subjected to one or more threshold criteria (e.g., a correctness probability, a level of confidence, a degree of trust, an author's influence, a rating, or a combination thereof) to better ensure its accuracy before being made available to mapping and/or location-based services that can use the map-related information to develop better quality maps and/or location-based mobile applications (e.g., improved routing guidance, location recommendations, etc.).
    Type: Grant
    Filed: December 8, 2011
    Date of Patent: March 10, 2015
    Assignee: Here Global B.V.
    Inventors: Yekesa Kosuru, Boris Lublinsky, Rajiv Synghal, Alexey Yakubovich
  • Publication number: 20140317124
    Abstract: An approach is provided for providing a unified extensible platform for overall probe data and storage. The approach comprises causing, at least in part, a storage of probe data in one or more information spaces, one or more namespaces of the one or more information spaces, or a combination thereof. The approach further comprises determining one or more nodes for processing the probe data based, at least in part, on one or more context criteria, the one or more nodes associated with the one or more information spaces. The approach also comprises determining to provide access to the processed probe data via the one or more information spaces, the one or more namespaces, or a combination thereof.
    Type: Application
    Filed: April 19, 2012
    Publication date: October 23, 2014
    Applicant: NAVTEQ NORTH AMERICA, LLC
    Inventors: Yekesa Kosuru, Alexey Yakubovich, Senthil Natesan, Rajiv Synghal, Boris Lublinsky
  • Publication number: 20130150087
    Abstract: An approach is provided for generating accurate and substantially real-time map and location-based data in a cost-effective manner. Specifically, one or more communications within one or more social networks are monitored, processed, and mined to determine map-related information (e.g., maps, traffic, points of interest). The map-related information is then subjected to one or more threshold criteria (e.g., a correctness probability, a level of confidence, a degree of trust, an author's influence, a rating, or a combination thereof) to better ensure its accuracy before being made available to mapping and/or location-based services that can use the map-related information to develop better quality maps and/or location-based mobile applications (e.g., improved routing guidance, location recommendations, etc.).
    Type: Application
    Filed: December 8, 2011
    Publication date: June 13, 2013
    Applicants: NAVTEQ North America, LLC, Nokia Corporation
    Inventors: Yekesa Kosuru, Boris Lublinsky, Rajiv Synghal, Alexey Yakubovich
  • Publication number: 20130036149
    Abstract: An approach is provided for creating a framework for executing code in nodes of a distributed storage platform. An in-node code framework receives at least one job for execution over a distributed computing platform. The in-node code framework determines at least one distributed storage platform containing at least a portion of the data for executing the at least one job. The in-node then processes and/or facilitates a processing of the at least one job to determine code for executing at one or more storage nodes of the at least one distributed storage platform, wherein the code supports the at least one job.
    Type: Application
    Filed: April 27, 2012
    Publication date: February 7, 2013
    Inventors: Yekesa Kosuru, Amit Jaiswal, Abhijit Bagri
  • Publication number: 20120136835
    Abstract: An approach is provided for rebalancing data. A backup of at least one database associated with a server is determined. A restoration of the backup to at least one other server is determined to be caused. Routing information to route queries for information stored in the at least one database is determined to be modified to the at least one other server as part of a rebalancing process.
    Type: Application
    Filed: November 30, 2010
    Publication date: May 31, 2012
    Applicant: Nokia Corporation
    Inventors: Yekesa Kosuru, John Cohen
  • Publication number: 20120117067
    Abstract: An approach is provided for creating a range ordered tree structure. A tree index platform determines one or more ranges for grouping one or more data objects of a key-value store. Next, the tree index platform determines to specify the one or more ranges in one or more respective index objects of a data structure. Then, the tree index platform determines to associate the data structure with the key-value store.
    Type: Application
    Filed: October 31, 2011
    Publication date: May 10, 2012
    Applicants: NAVTEQ North America, LLC, Nokia Corporation
    Inventors: Alexey Yakubovich, Yekesa Kosuru
  • Publication number: 20120110150
    Abstract: An approach is provided for upgrading components of a cluster. One or more components of at least one server of a cluster of servers are determined to be upgraded. Status information of the cluster, the at least one server, or a combination thereof is determined. It is determined whether to initiate another upgrade of one or more other components of the at least one server, another one of the servers, or a combination thereof based, at least in part, on the status information.
    Type: Application
    Filed: October 31, 2011
    Publication date: May 3, 2012
    Applicant: Nokia Corporation
    Inventors: Yekesa Kosuru, Anssi Juhani Alaranta
  • Publication number: 20110289052
    Abstract: Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry.
    Type: Application
    Filed: April 21, 2011
    Publication date: November 24, 2011
    Applicant: Nokia Corporation
    Inventors: Mark Rambacher, Abhijit Bagri, Yekesa Kosuru
  • Publication number: 20110153644
    Abstract: An approach is provided for utilizing a scalable data structure. A query specifying an entity identifier and requested content is received. A search is caused, at least in part, the search based on the entity identifier of a profile index of data structures, each specifying a profile field that is associated with an access control field to yield a search result. Access rights to the requested content are indicated for the entity identifier. The data structures further include the profile field and the access control field.
    Type: Application
    Filed: December 22, 2009
    Publication date: June 23, 2011
    Applicant: Nokia Corporation
    Inventors: Yekesa Kosuru, Jari Karjala, Matti Oikarinen
  • Publication number: 20090327055
    Abstract: A method and system for deploying and customizing advertisement selection logic without requiring a shutdown and/or restart of system resources. A first arrangement of advertisement logic may include filters to be executed in a pipeline model. A second arrangement of advertisement selection logic may be determined based at least in part on information received. Alternatively, the second arrangement of advertisement selection logic may be automatic based at least in part on statistics or defined hints. The second arrangement of advertisement selection logic may be implemented using different filters or rearranged filters in an updated pipeline model.
    Type: Application
    Filed: June 27, 2008
    Publication date: December 31, 2009
    Applicant: Nokia Corporation
    Inventor: Yekesa Kosuru
  • Publication number: 20090327075
    Abstract: Methods, system and computer readable media for distributing advertisements include minimizing storage costs for frequency capping, dividing a set of campaigns into slices and predetermining campaign-target matches. Frequency storage costs may be minimized by storing frequency data for those users or groups of users that have a high probability of exceeding a frequency limit. Additionally or alternatively, a set of campaigns may be divided into slices. Less than all of the slices may then be evaluated (i.e., instead of the entire set) against a user requesting an advertisement. Still further, all campaign-target matches may be evaluated prior to receiving advertisement requests. Re-evaluations may be performed when changes occur to the set of campaigns. The match data may be stored in bitset, hash map and bitmap storage structures.
    Type: Application
    Filed: June 27, 2008
    Publication date: December 31, 2009
    Applicant: NOKIA CORPORATION
    Inventors: Saied Saadat, Yekesa Kosuru