Search

Krishna Asur Bharat

from Palo Alto, CA
Age ~55
Get Report
Also known as:
Krishna A Bharat, Krishna Living Bharat, Asur Krishna Bharat, Bharath Krishnan
Phone and address:
1129 Hamilton Ave, Palo Alto, CA 94301
(650) 776-7213
Related to:
Radhika Raghavan, 52
Connected to:
Anil Bharat, 44Bruce A Bharat, 44Deepak Bharathan, 43Diane K Bharath, 46Diya Bharathi, 37Kumar K Bharath, 79Kumarr K Bharath, 45M R Bharath, 44Patel B Bharatkumar, 54Rajashri Bharathan, 46

Krishna Bharat Phones & Addresses

  • 1129 Hamilton Ave, Palo Alto, CA 94301 (650) 776-7213
  • Carmel, CA
  • 1458 Sierra Creek Way, San Jose, CA 95132 (408) 259-1819
  • 470 Oak Grove Dr, Santa Clara, CA 95054 (408) 727-2101
  • Sunnyvale, CA
  • Monterey, CA
  • Atlanta, GA
  • 1129 Hamilton Ave, Palo Alto, CA 94301

Work

Position: Professional/Technical

Education

Degree: Graduate or professional degree

Resumes

Resumes

Krishna Bharat Photo 1

Founding Advisor

View page
Location:
Palo Alto, CA
Industry:
Internet
Work:
Google Jul 2019 - Mar 2015
Distinguished Research Scientist
Grokstyle Jul 2019 - Mar 2015
Founding Advisor
Laserlike Inc Jul 2019 - Mar 2015
Founding Advisor
Dec Systems Research Center 1996 - 1999
Staff Research Scientist
Education:
Georgia Institute of Technology 1991 - 1996
Doctorates, Doctor of Philosophy, Computer Science Indian Institute of Technology, Madras 1987 - 1991
Bachelors, Bachelor of Technology, Computer Science
Skills:
Research
Krishna Bharat Photo 2

Krishna Bharat

View page
Krishna Bharat Photo 3

Krishna Bharat

View page

Publications

Wikipedia

Krishna Bharat

View page

Krishna Bharat, born in India, is a Distinguished Research Scientist at Google Inc, Mountain View, California, and leads a team developing Google's news product.

Amazon

Krishna Leela: The Impact Of Shri Krishna On Bharat's Spiritual Culture

Krishna Leela: The Impact of Shri Krishna on Bharat's Spiritual Culture

View page
Author

Mani Sahukar

Binding

Paperback

Publisher

Somaiya Publications, India

ISBN #

8

Wikipedia References

Krishna Bharat Photo 4

Krishna Bharat

Work:
Area of science:

Computer scientist

Education:
Studied at:

Georgia Institute of Technology • Indian Institute of Technology Madras

Skills & Activities:
Achieved status:

Indian emigrant

Skill:

Computer science

Krishna Bharat Photo 5

Krishna Bharat

Us Patents

Method For Learning Character Patterns To Interactively Control The Scope Of A Web Crawler

View page
US Patent:
6411952, Jun 25, 2002
Filed:
Jun 24, 1998
Appl. No.:
09/103904
Inventors:
Krishna Asur Bharat - Santa Clara CA
Robert Chisolm Miller - Pittsburgh PA
Assignee:
Compaq Information Technologies Group, LP - Houston TX
International Classification:
G06F 1730
US Classification:
707 5, 707 10
Abstract:
A method controls a Web search for server computer resources by an end-user Web crawler. Each resource, such as a Web page, is located by a resource address specified as a character string. The end-user defines a scope for an initial Web search by settings. The settings are used to search the Web for resources limited by the scope. The set of resources located during the search are rendered on output device, and positive and negative examples are selected from the set of resources to infer a rule. The rule is displayed, as well as a subset of resources that match on the rule. The selecting, inferring, and rendering steps are repeated while searching until a final rule is obtained. The rule matches resources that the crawler should process and does not match resource that it should avoid.

Method And Apparatus For Finding Mirrored Hosts By Analyzing Connectivity And Ip Addresses

View page
US Patent:
6487555, Nov 26, 2002
Filed:
May 7, 1999
Appl. No.:
09/307153
Inventors:
Krishna A. Bharat - Santa Clara CA
Andrei Z. Broder - Menlo Park CA
Steven C. Glassman - Mountain View CA
Jeffrey Dean - Menlo Park CA
Monika R. Henzinger - Menlo Park CA
Assignee:
Alta Vista Company - Palo Alto CA
International Classification:
G06F 1730
US Classification:
707 10, 707103, 709203, 709218
Abstract:
A method and system that detects mirrored host pairs using information about a large set of pages, including one or more of: URLs, IP addresses, and connectivity information. The identities of the detected mirrored hosts are then saved so that browsers, crawlers, proxy servers, or the like can correctly identify mirrored web sites. The described embodiments of the present invention use one or a combination of techniques to identify mirrors. A first group of techniques involves determining mirrors based on URLs and information about connectivity (i. e. , hyperlinks) between pages. A second group of techniques looks at connectivity information at a higher granularity, considering all links from all pages on a host as one group and ignoring the target of each link beyond the host level.

Ranking Search Results By Reranking The Results Based On Local Inter-Connectivity

View page
US Patent:
6526440, Feb 25, 2003
Filed:
Jan 30, 2001
Appl. No.:
09/771677
Inventors:
Krishna Bharat - Santa Clara CA
Assignee:
Google, Inc. - Mountain View CA
International Classification:
G06F 1300
US Classification:
709219, 707 3, 707 7
Abstract:
A search engine for searching a corpus improves the relevancy of the results by refining a standard relevancy score based on the interconnectivity of the initially returned set of documents. The search engine obtains an initial set of relevant documents by matching a users search terms to an index of a corpus. A re-ranking component in the search engine then refines the initially returned document rankings so that documents that are frequently cited in the initial set of relevant documents are preferred over documents that are less frequently cited within the initial set.

System And Method For Backing-Up Data Stored On A Portable Audio Player

View page
US Patent:
6577735, Jun 10, 2003
Filed:
Jun 8, 1999
Appl. No.:
09/327998
Inventors:
Krishna Asur Bharat - San Jose CA
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 1130
US Classification:
380286, 713153, 713161, 713165
Abstract:
A system creates an encrypted backup copy of the compressed audio data downloaded onto a portable audio player. When a user loads a portable audio player with audio data from a CD inserted into a computers CD-ROM drive, the system creates an encrypted copy of the compressed audio data and stores the encrypted copy on the computers hard disk. The encrypted copy cannot be used without a cryptographic key, but the system discards the cryptographic key once the encrypted copy of the audio data is stored. To extract usable audio data from the encrypted backup copy, it is necessary to re-insert the original CD and regenerate the cryptographic key. Once the cryptographic key is regenerated, the encrypted audio data can be decrypted and re-loaded onto the portable audio player.

Method For Estimating Coverage Of Web Search Engines

View page
US Patent:
6711568, Mar 23, 2004
Filed:
Nov 8, 2000
Appl. No.:
09/709003
Inventors:
Krishna Asur Bharat - Santa Clara CA, 95054
Andrei Zary Broder - Menlo Park CA, 94025
International Classification:
G06F 1730
US Classification:
707 5, 707 3, 707 4, 707 6, 707 10, 707103
Abstract:
A computerized method is used to estimate the relative coverage of Web search engines. Each search engine maintains an index of words of pages located at specific URL addresses in a network. The method generates a random query. The random query is a logical combination of words found in a subset of the pages. The random query is submitted to a first search engine. In response a set of URLs of pages matching the query are received. Each URL identifies a page indexed by the first search engine that satisfies the random query. A particular URL identifying a sample page is randomly selected. A strong query corresponding to the sample page is generated, and the strong query is submitted to a second search engine. Result information received in response to the strong query is compared to determine if the second search engine has indexed the sample page, or a page substantially similar to the sample page. This procedure is repeated to gather statistical data which is used to estimate the relative sizes and amount of overlap of search engines.

Ranking Search Results By Reranking The Results Based On Local Inter-Connectivity

View page
US Patent:
6725259, Apr 20, 2004
Filed:
Jan 27, 2003
Appl. No.:
10/351316
Inventors:
Krishna Bharat - Santa Clara CA
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 1300
US Classification:
709219, 707 3, 707 7
Abstract:
A search engine for searching a corpus improves the relevancy of the results by refining a standard relevancy score based on the interconnectivity of the initially returned set of documents. The search engine obtains an initial set of relevant documents by matching a users search terms to an index of a corpus. A re-ranking component in the search engine then refines the initially returned document rankings so that documents that are frequently cited in the initial set of relevant documents are preferred over documents that are less frequently cited within the initial set.

Method For Ranking Hyperlinked Pages Using Content And Connectivity Analysis

View page
US Patent:
6738678, May 18, 2004
Filed:
Jan 15, 1998
Appl. No.:
09/007635
Inventors:
Krishna Asur Bharat - Santa Clara CA, 95054
Monika R. Henzinger - Menlo Park CA, 94025
International Classification:
G05B 1302
US Classification:
700 48, 707 3, 707 4, 707 5, 358403
Abstract:
A computerized method determines the ranking of documents including information content. The present method uses both content and connectivity analysis. An input set of documents is represented as a neighborhood graph in a memory. In the graph, each node represents one document, and each directed edge connecting a pair of nodes represents a linkage between the pair of documents. The input set of documents represented in the graph is ranked according to the contents of the documents. A subset of documents is selected from the input set of documents if the content ranking of the selected documents is greater than a first predetermined threshold. Nodes representing any documents, other than the selected documents, are deleted from the graph. The selected subset of documents is ranked according the linkage of the documents, and an output set of documents exceeding a second predetermined threshold is selected for presentation to users.

Method And Apparatus For Query-Specific Bookmarking And Data Collection

View page
US Patent:
6810395, Oct 26, 2004
Filed:
Nov 22, 1999
Appl. No.:
09/444524
Inventors:
Krishna A. Bharat - Santa Clara CA
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 1730
US Classification:
707 4, 707 10, 7071041
Abstract:
A computer-implemented method and system providing both query-specific bookmarking and query-specific data collection. These features allow users to search more efficiently on the WWW by allowing users to explicitly maintain their search context. In addition, users can also collect query-specific relevance and usage data. User marked search results are saved as leads, which are displayed on a user interface such as a SearchPad. One embodiment of the invention involves extending HTML to include a Query attribute that saves the query context and returns it with a search result page. Another embodiment involves the use of cookies to save the query context. Saved query-specific bookmarks and query-specific data can be periodically saved to a central site, although not all embodiments perform this task.
Control profile
Krishna Asur Bharat from Palo Alto, CA, age ~55 Get Report