default search action
Suhrid Balakrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c13]Suhas Mathur, Baris Coskun, Suhrid Balakrishnan:
Detecting hidden enemy lines in IP address space. NSPW 2013: 19-30 - 2012
- [j3]Suhrid Balakrishnan, Sumit Chopra
:
Two of a kind or the ratings game? Adaptive pairwise preferences and latent factor models. Frontiers Comput. Sci. 6(2): 197-208 (2012) - [c12]Suhrid Balakrishnan, Sumit Chopra, David L. Applegate, Simon Urbanek
Computational Television Advertising. ICDM 2012: 71-80 - [c11]Emiliano Miluzzo, Alexander Varshavsky, Suhrid Balakrishnan, Romit Roy Choudhury:
Tapprints: your finger taps have fingerprints. MobiSys 2012: 323-336 - [c10]Suhrid Balakrishnan, Sumit Chopra:
Collaborative ranking. WSDM 2012: 143-152 - [c9]Suhrid Balakrishnan, Rensheng Wang, Carlos Eduardo Scheidegger, Angus MacLellan, Yifan Hu, Aaron Archer, Shankar Krishnan, David L. Applegate, Guangqin Ma, S. Tom Au:
Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2. KDD Cup 2012: 199-213 - 2010
- [c8]Suhrid Balakrishnan, Sumit Chopra:
Two of a Kind or the Ratings Game? Adaptive Pairwise Preferences and Latent Factor Models. ICDM 2010: 725-730 - [c7]Suhrid Balakrishnan:
On-demand set-based recommendations. RecSys 2010: 313-316 - [c6]Piotr Mirowski, Sumit Chopra, Suhrid Balakrishnan, Srinivas Bangalore:
Feature-rich continuous language models for speech recognition. SLT 2010: 241-246
2000 – 2009
- 2009
- [c5]Lihong Li, Jason D. Williams, Suhrid Balakrishnan:
Reinforcement learning for dialog management using least-squares Policy iteration and fast feature selection. INTERSPEECH 2009: 2475-2478 - [c4]Jason D. Williams, Suhrid Balakrishnan:
Estimating Probability of Correctness for ASR N-Best Lists. SIGDIAL Conference 2009: 132-135 - 2008
- [j2]Suhrid Balakrishnan, David Madigan:
Algorithms for Sparse Linear Classifiers in the Massive Data Setting. J. Mach. Learn. Res. 9: 313-337 (2008) - 2007
- [c3]Suhrid Balakrishnan, David Madigan:
Finding Predictive Runs with LAPS. ICDM 2007: 415-420 - 2006
- [c2]Suhrid Balakrishnan, David Madigan:
Decision Trees for Functional Variables. ICDM 2006: 798-802 - 2004
- [c1]Sastry S. Isukapalli, Suhrid Balakrishnan, Panos G. Georgopoulos:
Computationally efficient uncertainty propagation and reduction using the stochastic response surface method. CDC 2004: 2237-2243
1990 – 1999
- 1995
- [j1]Navab Singh, H. Zghal, Nariman Sepehri, Suhrid Balakrishnan, Peter D. Lawrence:
Coordinated-motion control of heavy-duty industrial machines with redundancy. Robotica 13(6): 623-633 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: