Patents by Inventor Sayan Ranu
Sayan Ranu 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: 10375593Abstract: The present disclosure relates to a method performed by a network node (54) in a communication network (50) comprising a plurality of communication devices (51), for finding temporally connected connection patterns of the communication devices in the network. The method comprises identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices.Type: GrantFiled: November 4, 2014Date of Patent: August 6, 2019Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Subramanian Shivashankar, Ankur Dauneria, Saket Gurukar, Sayan Ranu, Balaraman Ravindran
-
Publication number: 20170339590Abstract: The present disclosure relates to a method performed by a network node (54) in a communication network (50) comprising a plurality of communication devices (51), for finding temporally connected connection patterns of the communication devices in the network. The method comprises Identifying signalling identifying signalling between the communication devices during a predefined time duration to form a main communication graph in which the plurality of communication devices are nodes. The method also comprises partitioning the main communication graph for a time period comprised in said time duration to capture temporally connected signalling between some of the communication devices as illustrated in the main communication graph in a partitioned communication graph. The method also comprises forming at least one subgraph from the partitioned communication graph, comprising m nodes corresponding to m communication devices of said some of the communication devices.Type: ApplicationFiled: November 4, 2014Publication date: November 23, 2017Applicant: Telefonaktiebolaget LM Ericsson (publ)Inventors: Subramanian SHIVASHANKAR, Ankur DAUNERIA, Saket GURUKAR, Sayan RANU, Balaraman RAVINDRAN
-
Patent number: 9747805Abstract: Methods and arrangements for measuring similarity with respect to moving object trajectories. First and second moving object trajectories are input, each trajectory being defined by at least two spatial dimensions and a temporal dimension. At least one segment is defined with respect to each trajectory, each segment being defined between two defining points. At least one segment from the first trajectory is matched with at least one segment from the second trajectory. A spatial distance and temporal distance are each computed between the at least one segment from the first trajectory and the at least one segment from the second trajectory. The spatial distance and temporal distance are combined to provide a measure of a spatio-temporal distance between the at least one segment from the first trajectory and the at least one segment from the second trajectory. Other variants and embodiments are broadly contemplated herein.Type: GrantFiled: July 31, 2013Date of Patent: August 29, 2017Assignee: International Business Machines CorporationInventors: Prasad M. Deshpande, Deepak S. Padmanabhan, Sriram Raghavan, Sayan Ranu, Aditya D. Telang
-
Patent number: 9218460Abstract: A technique for mining pharmacophore patterns including computer-implemented methods for generating a database of pharmacophores and computer-implemented methods for classifying a query molecule with the database of pharmacophores. Generation of the pharmacophore database includes methods of defining a Joint Pharmacophore Space (JPS) using the three-dimensional geometry of pharmacophoric features of all active molecules against multiple targets.Type: GrantFiled: May 8, 2012Date of Patent: December 22, 2015Assignee: The Regents of the University of CaliforniaInventors: Ambuj K. Singh, Sayan Ranu
-
Publication number: 20150039217Abstract: Methods and arrangements for measuring similarity with respect to moving object trajectories. First and second moving object trajectories are input, each trajectory being defined by at least two spatial dimensions and a temporal dimension. At least one segment is defined with respect to each trajectory, each segment being defined between two defining points. At least one segment from the first trajectory is matched with at least one segment from the second trajectory. A spatial distance and temporal distance are each computed between the at least one segment from the first trajectory and the at least one segment from the second trajectory. The spatial distance and temporal distance are combined to provide a measure of a spatio-temporal distance between the at least one segment from the first trajectory and the at least one segment from the second trajectory. Other variants and embodiments are broadly contemplated herein.Type: ApplicationFiled: July 31, 2013Publication date: February 5, 2015Applicant: International Business Machines CorporationInventors: Prasad M. Deshpande, Deepak S. Padmanabhan, Sriram Raghavan, Sayan Ranu, Aditya D. Telang
-
Patent number: 8751618Abstract: A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.Type: GrantFiled: April 6, 2011Date of Patent: June 10, 2014Assignee: Yahoo! Inc.Inventors: Rushi Prafull Bhatt, Rajeev Rastogi, Vineet Shashikant Chaoji, Sayan Ranu
-
Patent number: 8396884Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.Type: GrantFiled: March 28, 2011Date of Patent: March 12, 2013Assignee: The Regents of the University of CaliforniaInventors: Ambuj Kumar Singh, Huahai He, Sayan Ranu
-
Publication number: 20120290624Abstract: A technique for mining pharmacophore patterns including computer-implemented methods for generating a database of pharmacophores and computer-implemented methods for classifying a query molecule with the database of pharmacophores. Generation of the pharmacophore database includes methods of defining a Joint Pharmacophore Space (JPS) using the three-dimensional geometry of pharmacophoric features of all active molecules against multiple targets.Type: ApplicationFiled: May 8, 2012Publication date: November 15, 2012Applicant: THE REGENTS OF THE UNIVERSITY OF CALIFORNIAInventors: Ambuj K. Singh, Sayan Ranu
-
Publication number: 20120259915Abstract: A method, a system and a computer program product for maximizing content spread in a social network are provided. Samples of edges are generated from an initial candidate set of edges. Each edge of the samples of edges has a probability value for content flow. Further, a subset of edges is determined from the samples of edges based on gain corresponding to each edge. Also, each node of the subset of edges is having at least one of less than ‘K’ or equal to ‘K’ incoming edges. Further, the probability of each edge, of the subset of edges, may be incremented. Furthermore, a final set of edges may be determined by ensuring ‘K’ incoming edges. The ‘K’ incoming edges may be ensured by removing one or more incoming edges when a number of the incoming edges for a node of the final set is greater than ‘K’ incoming edge.Type: ApplicationFiled: April 6, 2011Publication date: October 11, 2012Applicant: Yahoo! IncInventors: Rushi Prafull Bhatt, Rajeev Rastogi, Vineet Shashikant Chaoji, Sayan Ranu
-
Publication number: 20110173189Abstract: A method for analyzing, querying, and mining graph databases using subgraph and similarity querying. An index structure, known as a closure tree, is defined for topological summarization of a set of graphs. In addition, a significance model is created in which the graphs are transformed into histograms of primitive components. Finally, connected substructures or clusters, comprising paths or trees, are detected in networks found in the graph databases using a random walk technique and a repeated random walk technique.Type: ApplicationFiled: March 28, 2011Publication date: July 14, 2011Applicant: THE REGENTS OF THE UNIVERSITY OF CALIFORNIAInventors: Ambuj Kumar Singh, Huahai He, Sayan Ranu