Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Tushar A, Chandra"'
Autor:
Benjamin D. Leibowitz, Bonnie V. Dougherty, Joshua S. K. Bell, Joshuah Kapilivsky, Jackson Michuda, Andrew J. Sedgewick, Wesley A. Munson, Tushar A. Chandra, Jonathan R. Dry, Nike Beaubier, Catherine Igartua, Timothy Taxter
Publikováno v:
BMC Cancer, Vol 22, Iss 1, Pp 1-17 (2022)
Abstract Background With the introduction of DNA-damaging therapies into standard of care cancer treatment, there is a growing need for predictive diagnostics assessing homologous recombination deficiency (HRD) status across tumor types. Following th
Externí odkaz:
https://doaj.org/article/dabd382b971d4f07ac2e0b21a3f9c4c3
Autor:
Jon Effrat, Ayooluwakunmi Jeje, Moustafa Alzantot, Heng-Tze Cheng, Tameen Khan, Tushar Deepak Chandra, Ellie Ka-In Chio, Ajit Apte, Tarush Bali, Dima Kuzmin, Santiago Ontañón, Sukhdeep Sodhi, Allen Wu, Amol Wankhede, Senqiang Zhou, Harry Fung, Ankit Kumar, Ambarish Jash, Sarvjeet Singh, Pei Cao, Nitin Jindal
Publikováno v:
KDD
As more and more online search queries come from voice, automatic speech recognition becomes a key component to deliver relevant search results. Errors introduced by automatic speech recognition (ASR) lead to irrelevant search results returned to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abe885d12d0e1e2c88deda719a347baf
Autor:
Xiang Ma, Li Zhang, Tao Wu, Heng-Tze Cheng, Ritesh Agarwal, Yu Du, Steffen Rendle, Ankit Kumar, John Anderson, Sarvjeet Singh, Ed H. Chi, Ellie Ka-In Chio, Wen Li, Alex Soares, Pei Cao, Nitin Jindal, Dima Kuzmin, Tushar Deepak Chandra
Publikováno v:
CIKM
Many recent advances in neural information retrieval models, which predict top-K items given a query, learn directly from a large training set of (query, item) pairs. However, they are often insufficient when there are many previously unseen (query,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa815879e4f2196fc8b175ff3dfa5177
Autor:
Ritesh Agarwal, Craig Boutilier, Sanmit Narvekar, Eugene Ie, Jing Wang, Rui Wu, Vihan Jain, Tushar Deepak Chandra, Heng-Tze Cheng
Publikováno v:
IJCAI
Reinforcement learning methods for recommender systems optimize recommendations for long-term user engagement. However, since users are often presented with slates of multiple items---which may have interacting effects on user choice---methods are re
Autor:
Zakaria Haque, Hrishi Aradhye, Greg S. Corrado, Jeremiah Harmsen, Vihan Jain, Xiaobing Liu, Tushar Deepak Chandra, Mustafa Ispir, Glen Anderson, Wei Chai, Lichan Hong, Hemal Shah, Levent Koc, Rohan Anil, Tal Shaked, Heng-Tze Cheng
Publikováno v:
DLRS@RecSys
Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformatio
Publikováno v:
PODC
The problem. We consider the problem of implementing a consistent replicated object in a partially synchronous message passing distributed system susceptible to process and communication failures. The object is a generic shared resource, such as a da
Autor:
Fay W. Chang, Andrew Fikes, Sanjay Ghemawat, Robert E. Gruber, Michael Burrows, Wilson C. Hsieh, Tushar Deepak Chandra, Jeffrey Dean, Deborah A. Wallach
Publikováno v:
ACM Transactions on Computer Systems. 26:1-26
Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Goo
Publikováno v:
SIAM Journal on Computing. 34:333-357
We study the consensus problem, which requires multiple processes with different input values to agree on one of these values, in the context of asynchronous shared memory systems. Prior research focussed either on t-resilient solutions of this probl
Publikováno v:
Information Processing Letters. 71:167-172
An implementation of a shared object O is t-tolerant if the object remains correct and wait-free even when up to t base objects (objects used in the implementation of O) fail. The implementation is gracefully degrading if, no matter how many base obj