default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahsa Ghasemi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Mahsa Ghasemi, Hamid Hassanpour
:
FRIH: A face recognition framework using image hashing. Multim. Tools Appl. 83(21): 60147-60169 (2024)- [j4]Niklas T. Lauffer, Mahsa Ghasemi, Abolfazl Hashemi, Yagiz Savas, Ufuk Topcu:
No-Regret Learning in Dynamic Stackelberg Games. IEEE Trans. Autom. Control. 69(3): 1418-1431 (2024) - 2023
- [j3]Tichakorn Wongpiromsarn, Mahsa Ghasemi, Murat Cubuktepe, Georgios Bakirtzis, Steven Carr, Mustafa O. Karabag, Cyrus Neary, Parham Gohari, Ufuk Topcu:
Formal Methods for Autonomous Systems. Found. Trends Syst. Control. 10(3-4): 180-407 (2023) - 2021
- [j2]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
Randomized Greedy Sensor Selection: Leveraging Weak Submodularity. IEEE Trans. Autom. Control. 66(1): 199-212 (2021) - 2020
- [j1]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Reactive synthesis with maximum realizability of linear temporal logic specifications. Acta Informatica 57(1-2): 107-135 (2020)
Conference and Workshop Papers
- 2024
- [c20]Maheed H. Ahmed, Mahsa Ghasemi:
Privacy-Preserving Decentralized Actor-Critic for Cooperative Multi-Agent Reinforcement Learning. AISTATS 2024: 2755-2763 - [c19]Muhammad Qasim Elahi, Lai Wei, Murat Kocaoglu, Mahsa Ghasemi:
Adaptive Online Experimental Design for Causal Discovery. ICML 2024 - [c18]Jayanth Bhargav, Mahsa Ghasemi, Shreyas Sundaram:
Submodular information selection for hypothesis testing with misclassification penalties. L4DC 2024: 566-577 - 2023
- [c17]Somtochukwu Oguchienti, Mahsa Ghasemi:
Inverse Reinforcement Learning with Learning and Leveraging Demonstrators' Varying Expertise Levels. Allerton 2023: 1-8 - [c16]Jayanth Bhargav, Mahsa Ghasemi, Shreyas Sundaram:
On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes. ACC 2023: 3332-3337 - [c15]Lai Wei, Muhammad Qasim Elahi, Mahsa Ghasemi, Murat Kocaoglu:
Approximate Allocation Matching for Structural Causal Bandits with Unobserved Confounders. NeurIPS 2023 - 2021
- [c14]Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu:
Multiple Plans are Better than One: Diverse Stochastic Planning. ICAPS 2021: 140-148 - [c13]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Online Learning with Implicit Exploration in Episodic Markov Decision Processes. ACC 2021: 1953-1958 - [c12]Binghan He, Mahsa Ghasemi, Ufuk Topcu, Luis Sentis:
A Barrier Pair Method for Safe Human-Robot Shared Autonomy. CDC 2021: 2854-2861 - [c11]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
No-regret learning with high-probability in adversarial Markov decision processes. UAI 2021: 992-1001 - 2020
- [c10]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Identifying Sparse Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach. ACC 2020: 1093-1098 - [c9]Mahsa Ghasemi, Erdem Bulgur, Ufuk Topcu:
Task-Oriented Active Perception and Planning in Environments with Partially Known Semantics. ICML 2020: 3484-3493 - 2019
- [c8]Mahsa Ghasemi, Abolfazl Hashemi, Ufuk Topcu, Haris Vikalo:
On Submodularity of Quadratic Observation Selection in Constrained Networked Sensing Systems. ACC 2019: 4671-4676 - [c7]Mahsa Ghasemi, Ufuk Topcu:
Online Active Perception for Partially Observable Markov Decision Processes with Limited Budget. CDC 2019: 6169-6174 - [c6]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
Submodular Observation Selection and Information Gathering for Quadratic Models. ICML 2019: 2653-2662 - [c5]Mahsa Ghasemi, Ufuk Topcu:
Perception-Aware Point-Based Value Iteration for Partially Observable Markov Decision Processes. IJCAI 2019: 2371-2377 - 2018
- [c4]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks. ACC 2018: 1027-1032 - [c3]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Maximum Realizability for Linear Temporal Logic Specifications. ATVA 2018: 458-475 - [c2]Lu Feng, Mahsa Ghasemi, Kai-Wei Chang, Ufuk Topcu:
Counterexamples for Robotic Planning Explained in Structured Language. ICRA 2018: 7292-7297 - 2017
- [c1]Pasquale Palumbo, Mahsa Ghasemi, Mohammad Fakhroleslam:
On enzymatic reactions: The role of a feedback from the substrate. CDC 2017: 441-446
Editorship
- 2023
- [e1]Sayan Mitra, Nalini Venkatasubramanian, Abhishek Dubey, Lu Feng, Mahsa Ghasemi, Jonathan Sprinkle:
Proceedings of the ACM/IEEE 14th International Conference on Cyber-Physical Systems, ICCPS 2023, (with CPS-IoT Week 2023), San Antonio, TX, USA, May 9-12, 2023. ACM 2023 [contents]
Informal and Other Publications
- 2024
- [i13]Jayanth Bhargav, Mahsa Ghasemi, Shreyas Sundaram:
Submodular Information Selection for Hypothesis Testing with Misclassification Penalties. CoRR abs/2405.10930 (2024) - [i12]Muhammad Qasim Elahi, Lai Wei, Murat Kocaoglu, Mahsa Ghasemi:
Adaptive Online Experimental Design for Causal Discovery. CoRR abs/2405.11548 (2024) - [i11]Jayanth Bhargav, Mahsa Ghasemi, Shreyas Sundaram:
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms. CoRR abs/2407.07310 (2024) - 2023
- [i10]Tichakorn Wongpiromsarn, Mahsa Ghasemi, Murat Cubuktepe, Georgios Bakirtzis, Steven Carr, Mustafa O. Karabag, Cyrus Neary, Parham Gohari, Ufuk Topcu:
Formal Methods for Autonomous Systems. CoRR abs/2311.01258 (2023) - 2022
- [i9]Niklas T. Lauffer, Mahsa Ghasemi, Abolfazl Hashemi, Yagiz Savas, Ufuk Topcu:
No-Regret Learning in Dynamic Stackelberg Games. CoRR abs/2202.04786 (2022) - 2021
- [i8]Binghan He, Mahsa Ghasemi, Ufuk Topcu, Luis Sentis:
A Barrier Pair Method for Safe Human-Robot Shared Autonomy. CoRR abs/2112.00279 (2021) - 2020
- [i7]Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu:
Multiple Plans are Better than One: Diverse Stochastic Planning. CoRR abs/2012.15485 (2020) - 2019
- [i6]Mahsa Ghasemi, Abolfazl Hashemi, Haris Vikalo, Ufuk Topcu:
Identifying Low-Dimensional Structures in Markov Chains: A Nonnegative Matrix Factorization Approach. CoRR abs/1909.12898 (2019) - [i5]Mahsa Ghasemi, Ufuk Topcu:
Online Active Perception for Partially Observable Markov Decision Processes with Limited Budget. CoRR abs/1910.02130 (2019) - [i4]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Reactive Synthesis with Maximum Realizability of Linear Temporal Logic Specifications. CoRR abs/1910.02561 (2019) - 2018
- [i3]Lu Feng, Mahsa Ghasemi, Kai-Wei Chang, Ufuk Topcu:
Counterexamples for Robotic Planning Explained in Structured Language. CoRR abs/1803.08966 (2018) - [i2]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Maximum Realizability for Linear Temporal Logic Specifications. CoRR abs/1804.00415 (2018) - 2017
- [i1]Abolfazl Hashemi, Mahsa Ghasemi, Haris Vikalo, Ufuk Topcu:
A Randomized Greedy Algorithm for Near-Optimal Sensor Scheduling in Large-Scale Sensor Networks. CoRR abs/1709.08823 (2017)
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-11-04 21:39 CET 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:
