default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurad Tukan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Loay Mualem, Murad Tukan, Moran Feldman:
Bridging the Gap between General and Down-Closed Convex Sets in Submodular Maximization. IJCAI 2024: 1926-1934- [c11]Murad Tukan, Loay Mualem, Moran Feldman:
Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint. NeurIPS 2024 - [i17]Loay Mualem, Murad Tukan, Moran Feldman:
Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization. CoRR abs/2401.09251 (2024) - [i16]Murad Tukan, Loay Mualem, Moran Feldman:
Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint. CoRR abs/2405.13994 (2024) - 2023
- [c10]Alaa Maalouf, Murad Tukan, Vladimir Braverman, Daniela Rus:
AutoCoreset: An Automatic Practical Coreset Construction Framework. ICML 2023: 23451-23466 - [c9]Murad Tukan, Samson Zhou, Alaa Maalouf, Daniela Rus, Vladimir Braverman, Dan Feldman:
Provable Data Subset Selection For Efficient Neural Networks Training. ICML 2023: 34533-34555 - [c8]Alaa Maalouf, Murad Tukan, Noel Loo, Ramin M. Hasani, Mathias Lechner, Daniela Rus:
On the Size and Approximation Error of Distilled Datasets. NeurIPS 2023 - [i15]Murad Tukan, Eli Biton, Roee Diamant:
An Efficient Drifters Deployment Strategy to Evaluate Water Current Velocity Fields. CoRR abs/2301.04216 (2023) - [i14]Murad Tukan, Samson Zhou, Alaa Maalouf, Daniela Rus, Vladimir Braverman, Dan Feldman:
Provable Data Subset Selection For Efficient Neural Network Training. CoRR abs/2303.05151 (2023) - [i13]Alaa Maalouf, Murad Tukan, Vladimir Braverman, Daniela Rus:
AutoCoreset: An Automatic Practical Coreset Construction Framework. CoRR abs/2305.11980 (2023) - [i12]Alaa Maalouf, Murad Tukan, Noel Loo, Ramin M. Hasani, Mathias Lechner, Daniela Rus:
On the Size and Approximation Error of Distilled Sets. CoRR abs/2305.14113 (2023) - [i11]Murad Tukan, Alaa Maalouf, Margarita Osadchy:
Dataset Distillation Meets Provable Subset Selection. CoRR abs/2307.08086 (2023) - [i10]Murad Tukan, Fares Fares, Yotam Grufinkle, Ido Talmor, Loay Mualem, Vladimir Braverman, Dan Feldman:
ORBSLAM3-Enhanced Autonomous Toy Drones: Pioneering Indoor Exploration. CoRR abs/2312.13385 (2023) - 2022
- [c7]Murad Tukan, Xuan Wu, Samson Zhou, Vladimir Braverman, Dan Feldman:
New Coresets for Projective Clustering and Applications. AISTATS 2022: 5391-5415 - [c6]Alaa Maalouf, Murad Tukan, Eric Price, Daniel M. Kane, Dan Feldman:
Coresets for Data Discretization and Sine Wave Fitting. AISTATS 2022: 10622-10639 - [c5]Murad Tukan, Alaa Maalouf, Dan Feldman, Roi Poranne:
Obstacle Aware Sampling for Path Planning. IROS 2022: 13676-13683 - [c4]Murad Tukan, Loay Mualem, Alaa Maalouf:
Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions. NeurIPS 2022 - [i9]Alaa Maalouf, Murad Tukan, Eric Price, Daniel Kane, Dan Feldman:
Coresets for Data Discretization and Sine Wave Fitting. CoRR abs/2203.03009 (2022) - [i8]Murad Tukan, Alaa Maalouf, Dan Feldman, Roi Poranne:
Obstacle Aware Sampling for Path Planning. CoRR abs/2203.04075 (2022) - [i7]Murad Tukan, Xuan Wu, Samson Zhou, Vladimir Braverman, Dan Feldman:
New Coresets for Projective Clustering and Applications. CoRR abs/2203.04370 (2022) - [i6]Murad Tukan, Loay Mualem, Alaa Maalouf:
Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions. CoRR abs/2209.08554 (2022) - 2021
- [j3]Murad Tukan
, Alaa Maalouf, Matan Weksler, Dan Feldman:
No Fine-Tuning, No Cry: Robust SVD for Compressing Deep Networks. Sensors 21(16): 5599 (2021) - [j2]Alaa Maalouf, Ibrahim Jubran, Murad Tukan, Dan Feldman:
Coresets for the Average Case Error for Finite Query Sets. Sensors 21(19): 6689 (2021) - [j1]Murad Tukan, Cenk Baykal, Dan Feldman, Daniela Rus:
On coresets for support vector machines. Theor. Comput. Sci. 890: 171-191 (2021) - 2020
- [c3]Ibrahim Jubran, Murad Tukan, Alaa Maalouf, Dan Feldman:
Sets Clustering. ICML 2020: 4994-5005 - [c2]Murad Tukan, Alaa Maalouf, Dan Feldman:
Coresets for Near-Convex Functions. NeurIPS 2020 - [c1]Murad Tukan, Cenk Baykal, Dan Feldman, Daniela Rus:
On Coresets for Support Vector Machines. TAMC 2020: 287-299 - [i5]Murad Tukan, Cenk Baykal, Dan Feldman, Daniela Rus:
On Coresets for Support Vector Machines. CoRR abs/2002.06469 (2020) - [i4]Ibrahim Jubran, Murad Tukan, Alaa Maalouf, Dan Feldman:
Sets Clustering. CoRR abs/2003.04135 (2020) - [i3]Alaa Maalouf, Ibrahim Jubran, Murad Tukan, Dan Feldman:
Faster PAC Learning and Smaller Coresets via Smoothed Analysis. CoRR abs/2006.05441 (2020) - [i2]Murad Tukan, Alaa Maalouf, Dan Feldman:
Coresets for Near-Convex Functions. CoRR abs/2006.05482 (2020) - [i1]Murad Tukan, Alaa Maalouf, Matan Weksler, Dan Feldman:
Compressed Deep Networks: Goodbye SVD, Hello Robust Low-Rank Approximation. CoRR abs/2009.05647 (2020)
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 2025-02-15 01:15 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:
