default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMina Ghashami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Soumya Smruti Mishra, Mina Ghashami:
AmazUtah_NLP at SemEval-2024 Task 9: A MultiChoice Question Answering System for Commonsense Defying Reasoning. SemEval@NAACL 2024: 1436-1442- [i10]Mina Ghashami, Soumya Smruti Mishra:
AmazUtah_NLP at SemEval-2024 Task 9: A MultiChoice Question Answering System for Commonsense Defying Reasoning. CoRR abs/2405.10385 (2024) - [i9]Zhichao Hou, Mina Ghashami, Mikhail Kuznetsov, MohamadAli Torkamani:
HLogformer: A Hierarchical Transformer for Representing Log Data. CoRR abs/2408.16803 (2024) - 2022
- [i8]Venkat Varada, Mina Ghashami, Jitesh Mehta, Haotian Jiang, Kurtis Voris:
Low-cost Relevance Generation and Evaluation Metrics for Entity Resolution in AI. CoRR abs/2205.10298 (2022)
2010 – 2019
- 2017
- [b1]Mina Ghashami:
On Frequent Directions, a Streaming Matrix Sketching Algorithm. University of Utah, USA, 2017 - 2016
- [j3]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions: Simple and Deterministic Matrix Sketching. SIAM J. Comput. 45(5): 1762-1792 (2016) - [j2]Amey Desai, Mina Ghashami, Jeff M. Phillips:
Improved Practical Matrix Sketching with Guarantees. IEEE Trans. Knowl. Data Eng. 28(7): 1678-1690 (2016) - [c5]Mina Ghashami, Daniel J. Perry, Jeff M. Phillips:
Streaming Kernel Principal Component Analysis. AISTATS 2016: 1365-1374 - [c4]Mina Ghashami, Edo Liberty, Jeff M. Phillips:
Efficient Frequent Directions Algorithm for Sparse Matrices. KDD 2016: 845-854 - [i7]Mina Ghashami, Edo Liberty, Jeff M. Phillips:
Efficient Frequent Directions Algorithm for Sparse Matrices. CoRR abs/1602.00412 (2016) - 2015
- [i6]Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions : Simple and Deterministic Matrix Sketching. CoRR abs/1501.01711 (2015) - [i5]Amey Desai, Mina Ghashami, Jeff M. Phillips:
Improved Practical Matrix Sketching with Guarantees. CoRR abs/1501.06561 (2015) - [i4]Mina Ghashami, Amirali Abdullah:
Binary Coding in Stream. CoRR abs/1503.06271 (2015) - [i3]Mina Ghashami, Daniel J. Perry, Jeff M. Phillips:
Streaming Kernel Principal Component Analysis. CoRR abs/1512.05059 (2015) - 2014
- [j1]Mina Ghashami, Jeff M. Phillips, Feifei Li:
Continuous Matrix Approximation on Distributed Data. Proc. VLDB Endow. 7(10): 809-820 (2014) - [c3]Mina Ghashami, Amey Desai, Jeff M. Phillips:
Improved Practical Matrix Sketching with Guarantees. ESA 2014: 467-479 - [c2]Mina Ghashami, Jeff M. Phillips:
Relative Errors for Deterministic Low-Rank Matrix Approximations. SODA 2014: 707-717 - [i2]Mina Ghashami, Jeff M. Phillips, Feifei Li:
Continuous Matrix Approximation on Distributed Data. CoRR abs/1404.7571 (2014) - 2013
- [i1]Mina Ghashami, Jeff M. Phillips:
Relative Errors for Deterministic Low-Rank Matrix Approximations. CoRR abs/1307.7454 (2013) - 2012
- [c1]Mina Ghashami, Hoda Mashayekhi
, Jafar Habibi:
DLPR: A Distributed Locality Preserving Dimension Reduction Algorithm. IDCS 2012: 97-110
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-09-30 00:10 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:
