Search

Sayan Ranu

from Redmond, WA
Age ~40
Get Report
Related to:
Koyel Ranu
Connected to:
Alex M Ranu, 52Rai Ranu, 41Joel M Ranua, 57Andrew J Ranucci, 60Mark V Ranuda, 40Erin Ranum, 36Jelena W Ranum, 51Larry D Ranum, 75Karen S Ranus, 61Timothy N Ranville, 72

Sayan Ranu Phones & Addresses

  • Redmond, WA
  • Bellevue, WA
  • San Jose, CA
  • Goleta, CA
  • Medford, MA
  • Ames, IA

Work

Company: Ibm May 2012 Position: Researcher

Education

Degree: Doctor of Philosophy (Ph.D.) School / High School: University of California, Santa Barbara 2006 to 2011 Specialities: Computer Science

Industries

Computer Software

Resumes

Resumes

Sayan Ranu Photo 1

Researcher At Ibm

View page
Position:
Researcher at IBM
Location:
Bengaluru, Karnataka, India
Industry:
Computer Software
Work:
IBM since May 2012
Researcher
Yahoo! Jun 2010 - Sep 2010
Intern at Yahoo Research
Yahoo! Jun 2009 - Sep 2009
Intern
Nokia Jun 2007 - Sep 2007
Internship in Nokia Research, Cambridge
Education:
University of California, Santa Barbara 2006 - 2011
Doctor of Philosophy (Ph.D.), Computer Science Iowa State University 2002 - 2006
BS, Computer Science

Business Records

Name / Title
Company / Classification
Phones & Addresses
Sayan None Ranu
President
SRISHTI
Business Services at Non-Commercial Site
7321 Freeman Pl, Goleta, CA 93117

Publications

Us Patents

Graph Querying, Graph Motif Mining And The Discovery Of Clusters

View page
US Patent:
20110173189, Jul 14, 2011
Filed:
Mar 28, 2011
Appl. No.:
13/073452
Inventors:
Ambuj Kumar Singh - Santa Barbara CA, US
Huahai He - San Jose CA, US
Sayan Ranu - Goleta CA, US
Assignee:
THE REGENTS OF THE UNIVERSITY OF CALIFORNIA - Oakland CA
International Classification:
G06F 17/30
US Classification:
707722, 707E17009
Abstract:
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.

Method And System For Maximizing Content Spread In Social Network

View page
US Patent:
20120259915, Oct 11, 2012
Filed:
Apr 6, 2011
Appl. No.:
13/080661
Inventors:
Rushi Prafull Bhatt - Surat, IN
Rajeev Rastogi - Bangalore, IN
Vineet Shashikant Chaoji - Bangalore, IN
Sayan Ranu - Goleta CA, US
Assignee:
Yahoo! Inc - Sunnyvale CA
International Classification:
G06F 15/16
US Classification:
709204
Abstract:
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.

Defining And Mining A Joint Pharmacophoric Space Through Geometric Features

View page
US Patent:
20120290624, Nov 15, 2012
Filed:
May 8, 2012
Appl. No.:
13/466669
Inventors:
Ambuj K. Singh - Santa Barbara CA, US
Sayan Ranu - Goleta CA, US
Assignee:
THE REGENTS OF THE UNIVERSITY OF CALIFORNIA - Oakland CA
International Classification:
G06F 17/30
US Classification:
707803, 707E17044
Abstract:
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.
Control profile
Sayan Ranu from Redmond, WA, age ~40 Get Report