Showing 1 - 3 results of 3 for search 'Srinivasan Keshav' Skip to content
    • About the Library
    • Rules and Regulations
    • Library Services
    • Library Hours
  • Library News
    • Digital Repository
    • Google Scholar
    • ResearchGate
    • AJoGPL
    • KURJ
    • AJLS
    • MyLOFT
    • Lexis Plus UK
    • Britannica Academic
    • Research Support Tools
    • Quick Resource Links
  • Login
Advanced
  • Author
  • Srinivasan Keshav

Srinivasan Keshav

Srinivasan Keshav is a computer scientist who is currently the Robert Sansom Professor of Computer Science at the University of Cambridge. Provided by Wikipedia
Showing 1 - 3 results of 3 for search 'Srinivasan Keshav', query time: 0.03s Refine Results
  1. 1
    SPREAD: A large-scale, high-fidelity synthetic dataset for multiple forest vision tasks

    SPREAD: A large-scale, high-fidelity synthetic dataset for multiple forest vision tasks by Zhengpeng Feng, Yihang She, Srinivasan Keshav

    Published 2025-07-01
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Usage Patterns of Electric Bicycles: An Analysis of the WeBike Project

    Usage Patterns of Electric Bicycles: An Analysis of the WeBike Project by Christian Gorenflo, Ivan Rios, Lukasz Golab, Srinivasan Keshav

    Published 2017-01-01
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Mitigating risk of credit reversal in nature-based climate solutions by optimally anticipating carbon release

    Mitigating risk of credit reversal in nature-based climate solutions by optimally anticipating carbon release by E-Ping Rau, James Gross, David Anthony Coomes, Thomas Swinfield, Anil Madhavapeddy, Andrew Balmford, Srinivasan Keshav

    Published 2024-12-01
    Get full text
    Article
    Save to List
    Saved in:

Search Tools:

  • RSS Feed
  • Email Search

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs