default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavid Dadashkarimi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j3]Javid Dadashkarimi
, Amin Karbasi, Qinghao Liang, Matthew Rosenblatt, Stephanie Noble, Maya Foster, Raimundo X. Rodriguez, Brendan Adkinson, Jean Ye, Huili Sun, Chris Camp, Michael Farruggia, Link Tejavibulya, Wei Dai, Rongtao Jiang, Angeliki Pollatou, Dustin Scheinost:
Cross Atlas Remapping via Optimal Transport (CAROT): Creating connectomes for different atlases when raw data is not available. Medical Image Anal. 88: 102864 (2023)- 2017
- [j2]Javid Dadashkarimi, Azadeh Shakery, Heshaam Faili, Hamed Zamani:
An expectation-maximization algorithm for query translation based on pseudo-relevant documents. Inf. Process. Manag. 53(2): 371-387 (2017) - 2016
- [j1]Razieh Rahimi, Azadeh Shakery, Javid Dadashkarimi, Mozhdeh Ariannezhad, Mostafa Dehghani, Hossein Nasr Esfahani:
Building a multi-domain comparable corpus using a learning to rank method. Nat. Lang. Eng. 22(4): 627-653 (2016)
Conference and Workshop Papers
- 2023
- [c12]Javid Dadashkarimi, Matthew Rosenblatt, Amin Karbasi, Dustin Scheinost:
Stacking multiple optimal transport policies to map functional connectomes. CISS 2023: 1-6 - [c11]Matthew Rosenblatt, Javid Dadashkarimi, Dustin Scheinost:
Gradient-Based Enhancement Attacks in Biomedical Machine Learning. CLIP/FAIMI/EPIMI@MICCAI 2023: 301-312 - 2022
- [c10]Qinghao Liang, Javid Dadashkarimi, Wei Dai, Amin Karbasi, Joseph Chang, Harrison H. Zhou, Dustin Scheinost:
Transforming Connectomes to "Any" Parcellation via Graph Matching. ISGIE/GRAIL@MICCAI 2022: 118-127 - [c9]Javid Dadashkarimi, Amin Karbasi, Dustin Scheinost:
Combining Multiple Atlases to Estimate Data-Driven Mappings Between Functional Connectomes Using Optimal Transport. MICCAI (1) 2022: 386-395 - 2021
- [c8]Javid Dadashkarimi, Amin Karbasi, Dustin Scheinost:
Data-Driven Mapping Between Functional Connectomes Using Optimal Transport. MICCAI (3) 2021: 293-302 - 2019
- [c7]Javid Dadashkarimi, Siyuan Gao, Erin Yeagle, Stephanie Noble, Dustin Scheinost:
A Mass Multivariate Edge-wise Approach for Combining Multiple Connectomes to Improve the Detection of Group Differences. CNI@MICCAI 2019: 64-73 - 2017
- [c6]Javid Dadashkarimi, Mahsa S. Shahshahani, Amirhossein Tebbifakhr, Heshaam Faili, Azadeh Shakery:
Dimension Projection Among Languages Based on Pseudo-Relevant Documents for Query Translation. ECIR 2017: 493-499 - 2016
- [c5]Hamed Zamani, Javid Dadashkarimi, Azadeh Shakery, W. Bruce Croft:
Pseudo-Relevance Feedback Based on Matrix Factorization. CIKM 2016: 1483-1492 - [c4]Javid Dadashkarimi, Hossein Nasr Esfahani, Heshaam Faili, Azadeh Shakery:
SS4MCT: A Statistical Stemmer for Morphologically Complex Texts. CLEF 2016: 201-207 - [c3]Javid Dadashkarimi, Masoud Jalili Sabet, Azadeh Shakery:
Learning to Weight Translations using Ordinal Linear Regression and Query-generated Training Data for Ad-hoc Retrieval with Long Queries. COLING 2016: 1725-1733 - [c2]Hossein Nasr Esfahani, Javid Dadashkarimi, Azadeh Shakery:
Profile-based Translation in Multilingual Expertise Retrieval. MultiLingMine@ECIR 2016: 26-35 - 2015
- [c1]Shayan A. Tabrizi, Javid Dadashkarimi, Mostafa Dehghani, Hassan Nasr Esfahani, Azadeh Shakery:
Revisiting Optimal Rank Aggregation: A Dynamic Programming Approach. ICTIR 2015: 353-356
Informal and Other Publications
- 2023
- [i9]Matthew Rosenblatt, Javid Dadashkarimi, Dustin Scheinost:
Enhancement attacks in biomedical machine learning. CoRR abs/2301.01885 (2023) - 2022
- [i8]Mohammad Fereydounian, Hamed Hassani, Javid Dadashkarimi, Amin Karbasi:
The Exact Class of Graph Functions Generated by Graph Neural Networks. CoRR abs/2202.08833 (2022) - 2021
- [i7]Javid Dadashkarimi, Amin Karbasi, Dustin Scheinost:
Data-driven mapping between functional connectomes using optimal transport. CoRR abs/2107.01303 (2021) - 2018
- [i6]Javid Dadashkarimi, Sekhar Tatikonda:
Sequence to Logic with Copy and Cache. CoRR abs/1807.07333 (2018) - [i5]Javid Dadashkarimi, Alexander R. Fabbri, Sekhar Tatikonda, Dragomir R. Radev:
Zero-shot Transfer Learning for Semantic Parsing. CoRR abs/1808.09889 (2018) - 2016
- [i4]Javid Dadashkarimi, Mahsa S. Shahshahani, Amirhossein Tebbifakhr, Heshaam Faili, Azadeh Shakery:
Dimension Projection among Languages based on Pseudo-relevant Documents for Query Translation. CoRR abs/1605.07844 (2016) - [i3]Javid Dadashkarimi, Hossein Nasr Esfahani, Heshaam Faili, Azadeh Shakery:
Unsupervised Formation Matching in Highly Inflected Languages. CoRR abs/1605.07852 (2016) - [i2]Javid Dadashkarimi, Masoud Jalili Sabet, Azadeh Shakery, Heshaam Faili:
Low-dimensional Query Projection based on Divergence Minimization Feedback Model for Ad-hoc Retrieval. CoRR abs/1606.00615 (2016) - 2014
- [i1]Javid Dadashkarimi, Azadeh Shakery, Heshaam Faili:
A Probabilistic Translation Method for Dictionary-based Cross-lingual Information Retrieval in Agglutinative Languages. CoRR abs/1411.1006 (2014)
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:07 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:
