Search results for "prune"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
52	Alexandre Goldsztejn	A branch and prune algorithm for the approximation of non-linear AE-solution sets.	SAC	2006	DBLP DOI BibTeX RDF	AE-solution set, branch and prune, hansen-sengupta, generalized intervals
52	Weishui Wan, Kotaro Hirasawa, Jinglu Hu, Chunzhi Jin	A New Method to Prune the Neural Network.	IJCNN (6)	2000	DBLP DOI BibTeX RDF	statistical quantity, neural networks, prune, backpropagation algorithm
45	Daniel J. Tracy, Samuel R. Buss, Bryan M. Woods	Efficient Large-Scale Sweep and Prune Methods with AABB Insertion and Removal.	VR	2009	DBLP DOI BibTeX RDF
39	Rajan Sahu, Shivam Chadha, Nithin Nagaraj, Archana Mathur, Snehanshu Saha	To prune or not to prune : A chaos-causality approach to principled pruning of dense neural networks.	CoRR	2023	DBLP DOI BibTeX RDF
39	Maham Haroon	What to Prune and What Not to Prune at Initialization.	CoRR	2022	DBLP DOI BibTeX RDF
39	Cheng-I Jeff Lai, Yang Zhang 0001, Alexander H. Liu, Shiyu Chang, Yi-Lun Liao, Yung-Sung Chuang, Kaizhi Qian, Sameer Khurana, David D. Cox, James R. Glass	PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition.	CoRR	2021	DBLP BibTeX RDF
39	Cheng-I Jeff Lai, Yang Zhang 0001, Alexander H. Liu, Shiyu Chang, Yi-Lun Liao, Yung-Sung Chuang, Kaizhi Qian, Sameer Khurana, David D. Cox, Jim Glass	PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition.	NeurIPS	2021	DBLP BibTeX RDF
39	Sara Elkerdawy, Mostafa Elhoushi, Abhineet Singh, Hong Zhang 0013, Nilanjan Ray	To filter prune, or to layer prune, that is the question.	CoRR	2020	DBLP BibTeX RDF
39	Sara Elkerdawy, Mostafa Elhoushi, Abhineet Singh, Hong Zhang 0013, Nilanjan Ray	To Filter Prune, or to Layer Prune, That Is the Question.	ACCV (3)	2020	DBLP DOI BibTeX RDF
39	Michael Zhu, Suyog Gupta	To Prune, or Not to Prune: Exploring the Efficacy of Pruning for Model Compression.	ICLR (Workshop)	2018	DBLP BibTeX RDF
39	Michael Zhu, Suyog Gupta	To prune, or not to prune: exploring the efficacy of pruning for model compression.	CoRR	2017	DBLP BibTeX RDF
36	Thilo Mende, Felix Beckwermert, Rainer Koschke, Gerald Meier	Supporting the Grow-and-Prune Model in Software Product Lines Evolution Using Clone Detection.	CSMR	2008	DBLP DOI BibTeX RDF
36	Richard Nock, Pascal Jappy	A "Top-Down and Prune" Induction Scheme for Constrained Decision Committees.	IDA	1999	DBLP DOI BibTeX RDF
36	Prune Inzerilli, Vladimir Kostic, Karim Lounici, Pietro Novelli, Massimiliano Pontil	Consistent Long-Term Forecasting of Ergodic Dynamical Systems.	CoRR	2023	DBLP DOI BibTeX RDF
36	Prune Truong, Martin Danelljan, Radu Timofte, Luc Van Gool	PDC-Net+: Enhanced Probabilistic Dense Correspondence Network.	IEEE Trans. Pattern Anal. Mach. Intell.	2023	DBLP DOI BibTeX RDF
36	Prune Truong, Marie-Julie Rakotosaona, Fabian Manhardt, Federico Tombari	SPARF: Neural Radiance Fields from Sparse and Noisy Poses.	CVPR	2023	DBLP DOI BibTeX RDF
36	David Brüggemann, Christos Sakaridis, Prune Truong, Luc Van Gool	Refign: Align and Refine for Adaptation of Semantic Segmentation to Adverse Conditions.	WACV	2023	DBLP DOI BibTeX RDF
36	Prune Truong, Marie-Julie Rakotosaona, Fabian Manhardt, Federico Tombari	SPARF: Neural Radiance Fields from Sparse and Noisy Poses.	CoRR	2022	DBLP DOI BibTeX RDF
36	Prune Truong, Martin Danelljan, Fisher Yu 0001, Luc Van Gool	Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences.	CoRR	2022	DBLP DOI BibTeX RDF
36	David Brüggemann, Christos Sakaridis, Prune Truong, Luc Van Gool	Refign: Align and Refine for Adaptation of Semantic Segmentation to Adverse Conditions.	CoRR	2022	DBLP DOI BibTeX RDF
36	Prune Truong, Martin Danelljan, Fisher Yu 0001, Luc Van Gool	Probabilistic Warp Consistency for Weakly-Supervised Semantic Correspondences.	CVPR	2022	DBLP DOI BibTeX RDF
36	Prune Truong, Martin Danelljan, Luc Van Gool, Radu Timofte	Learning Accurate Dense Correspondences and When to Trust Them.	CoRR	2021	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Fisher Yu 0001, Luc Van Gool	Warp Consistency for Unsupervised Learning of Dense Correspondences.	CoRR	2021	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Radu Timofte, Luc Van Gool	PDC-Net+: Enhanced Probabilistic Dense Correspondence Network.	CoRR	2021	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Fisher Yu 0001, Luc Van Gool	Warp Consistency for Unsupervised Learning of Dense Correspondences.	ICCV	2021	DBLP DOI BibTeX RDF
36	Prune Truong, Martin Danelljan, Luc Van Gool, Radu Timofte	Learning Accurate Dense Correspondences and When To Trust Them.	CVPR	2021	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Luc Van Gool, Radu Timofte	GOCor: Bringing Globally Optimized Correspondence Volumes into Your Neural Network.	CoRR	2020	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Radu Timofte	GLU-Net: Global-Local Universal Network for Dense Flow and Correspondences.	CVPR	2020	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Luc Van Gool, Radu Timofte	GOCor: Bringing Globally Optimized Correspondence Volumes into Your Neural Network.	NeurIPS	2020	DBLP BibTeX RDF
36	Prune Truong, Martin Danelljan, Radu Timofte	GLU-Net: Global-Local Universal Network for Dense Flow and Correspondences.	CoRR	2019	DBLP BibTeX RDF
36	Prune Truong, Stefanos Apostolopoulos, Agata Mosinska, Samuel Stucky, Carlos Ciller, Sandro De Zanet	GLAMpoints: Greedily Learned Accurate Match points.	CoRR	2019	DBLP BibTeX RDF
36	Prune Truong, Stefanos Apostolopoulos, Agata Mosinska, Samuel Stucky, Carlos Ciller, Sandro De Zanet	GLAMpoints: Greedily Learned Accurate Match Points.	ICCV	2019	DBLP DOI BibTeX RDF
36	Sébastien Faye, Foued Melakessou, Prune Gautier, Djamel Khadraoui	No Time to Waste, with SWAM!	BuildSys@SenSys	2019	DBLP DOI BibTeX RDF
36	Sébastien Faye, Foued Melakessou, Wassila Mtalaa, Prune Gautier, Neamah AlNaffakh, Djamel Khadraoui	SWAM: A Novel Smart Waste Management Approach for Businesses using IoT.	TESCA	2019	DBLP DOI BibTeX RDF
36	Nina Sandschulte, Jacqueline Eitzert, Anna Heuer, Sabrina Plate, Justine Prüne, Jana Striepens, Josephine Zentner, Maike Naumann, Knut Barghorn	Informationsvisualisierung im Alltag.	UP	2017	DBLP DOI BibTeX RDF
32	Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton	Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	subtree prune and regraft (SPR), BSPR algorithm, Nearest Neighbor Interchange (NNI), BNNI algorithm, balanced minimum evolution principle (BME), tree-length, quartet-distance, Robinson Foulds distance, safety radius, topological move, consistency, phylogenetic tree
32	Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan	Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem.	GECCO	2009	DBLP DOI BibTeX RDF	branch and prune, monkey search, protein molecules, combinatorial optimization, distance geometry
32	Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chaplin	PnP: sequential, external memory, and parallel iceberg cube computation.	Distributed Parallel Databases	2008	DBLP DOI BibTeX RDF	Pipe ’n Prune (PnP), Iceberg cube query, Parallel computing, OLAP, Data cube
32	Chao-Yang Gau, Mark A. Stadtherr	Parallel interval-Newton using message passing: dynamic load balancing strategies.	SC	2001	DBLP DOI BibTeX RDF	branch-and-prune, parallel computing, global optimization, branch-and-bound, interval analysis, nonlinear equations
32	Pankaj K. Agarwal, Micha Sharir	Efficient Algorithms for Geometric Optimization.	ACM Comput. Surv.	1998	DBLP DOI BibTeX RDF	proximity problems, prune-and-search, clustering, linear programming, randomized algorithms, collision detection, parametric searching, matrix searching
32	Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh	A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks.	ICPADS	1996	DBLP DOI BibTeX RDF	multistage graphs, prune-and-search technique, interconnection network, multiprocessor system, multistage interconnection networks, linear-time algorithm, WK-recursive networks
32	Kim L. Boyer, Muhammad J. Mirza, Gopa Ganguly	The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range Data.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	robust sequential estimator, surface organization, autonomous statistically robust sequential function approximation, partially occluded surfaces, noisy outlier-ridden functional range data, sequential least squares, surface characterization techniques, surface hypotheses, noisy depth map, unknown 3-D scene, seed points, modified Akaike Information Criterion, prune stage, coincidental surface alignment, weighted voting scheme, 5/spl times/5 decision window, ambiguous point, majority consensus, image segmentation, information theory, decision theory, parameterization, function approximation, estimation theory, range data, parameter space
28	Jong Wook Kim, K. Selçuk Candan	Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	ranking, top-k
28	Vicente Ruiz de Angulo, Carme Torras	Exploiting Single-Cycle Symmetries in Branch-and-Prune algorithms.	CP	2007	DBLP DOI BibTeX RDF
28	Rui Araújo	Prune-Able Fuzzy ART Neural Architecture for Robot Map Learning and Navigation in Dynamic Environments.	IEEE Trans. Neural Networks	2006	DBLP DOI BibTeX RDF
28	Stéphane Bressan, Achmad Nizar Hidayanto, Zainal Arifin Hasibuan	Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems.	DEXA Workshops	2005	DBLP DOI BibTeX RDF
28	Hilan Bensusan	God Doesn't Always Shave with Occam's Razor - Learning When and How to Prune.	ECML	1998	DBLP DOI BibTeX RDF
28	David G. Kirkpatrick, Jack Snoeyink	Tentative Prune-and-Search for Computing Voronoi Vertices.	SCG	1993	DBLP DOI BibTeX RDF
25	Thomas Douillard, Christophe Jermann	Splitting heuristics for disjunctive numerical constraints.	SAC	2008	DBLP DOI BibTeX RDF	splitting heuristics, numerical constraints, disjunctions
25	Marc Eaddy, Alfred V. Aho, Giuliano Antoniol, Yann-Gaël Guéhéneuc	CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis.	ICPC	2008	DBLP DOI BibTeX RDF
25	Xu Yusheng, Zhang Lanhui, Zhixin Ma, Li Lian, Xiaoyun Chen, Tharam S. Dillon	Mining Sequential Pattern Using DF2Ls.	FSKD (2)	2008	DBLP DOI BibTeX RDF
25	Danny Z. Chen, Jinhui Xu 0001	Two-Variable Linear Programming in Parallel.	SWAT	1998	DBLP DOI BibTeX RDF
24	Magnus Bordewich, Charles Semple	Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	Rooted phylogenetic tree, reticulate evolution, agreement forest, subtree prune and regraft, hybridization network
24	Jie Liu 0025, Liang Feng, Yunpeng Xing	A pruning-based approach for supporting Top-K join queries.	WWW	2006	DBLP DOI BibTeX RDF	prune, top-K, join query
24	Frédéric Goualard	On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure.	SAC	2005	DBLP DOI BibTeX RDF	branch-and-prune method, constraint, nonlinear system
24	Luay Nakhleh, Tandy J. Warnow, C. Randal Linder	Reconstructing reticulate evolution in species: theory and practice.	RECOMB	2004	DBLP DOI BibTeX RDF	gene trees, subtree prune and regraft, phylogenetic networks
19	Felipe Fidalgo, Emerson V. Castelani, Guilherme Philippi	A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems.	Comput. Optim. Appl.	2024	DBLP DOI BibTeX RDF
19	Shayesteh Arasti, Siavash Mirarab	Median quartet tree search algorithms using optimal subtree prune and regraft.	Algorithms Mol. Biol.	2024	DBLP DOI BibTeX RDF
19	Lucio M. Dery, Steven Kolawole, Jean-François Kagey, Virginia Smith, Graham Neubig, Ameet Talwalkar	Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes.	CoRR	2024	DBLP DOI BibTeX RDF
19	Xun Wang, John Rachwan, Stephan Günnemann, Bertrand Charpentier	Structurally Prune Anything: Any Architecture, Any Framework, Any Time.	CoRR	2024	DBLP DOI BibTeX RDF
19	Babak Ehteshami Bejnordi, Gaurav Kumar, Amelie Royer, Christos Louizos, Tijmen Blankevoort, Mohsen Ghafoorian	InterroGate: Learning to Share, Specialize, and Prune Representations for Multi-task Learning.	CoRR	2024	DBLP DOI BibTeX RDF
19	Tanishq Kumar, Kevin Luo, Mark Sellke	No Free Prune: Information-Theoretic Barriers to Pruning at Initialization.	CoRR	2024	DBLP DOI BibTeX RDF
19	Jiwei Zhang 0013, Dena Tayebi, Saurabh Ray, Deepak Ajwani	Learning to Prune Instances of Steiner Tree Problem in Graphs.	INOC	2024	DBLP DOI BibTeX RDF
19	Soheun Yi, Sanghack Lee	Filter, Rank, and Prune: Learning Linear Cyclic Gaussian Graphical Models.	AISTATS	2024	DBLP BibTeX RDF
19	I. Zakir Ahmed, Hamid R. Sadjadpour, Shahram Yousefi	An Information-Theoretic Branch-and-Prune Algorithm for Discrete Phase Optimization of RIS in Massive MIMO.	IEEE Trans. Veh. Technol.	2023	DBLP DOI BibTeX RDF
19	Steven Kelk, Simone Linz, Ruben Meuwese	Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance.	Inf. Process. Lett.	2023	DBLP DOI BibTeX RDF
19	Stefan Schwarze, Oliver Stein	A branch-and-prune algorithm for discrete Nash equilibrium problems.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
19	Jiaqi Cao, Monan Wang 0001	A Fast and Generalized Broad-Phase Collision Detection Method Based on KD-Tree Spatial Subdivision and Sweep-and-Prune.	IEEE Access	2023	DBLP DOI BibTeX RDF
19	Qing Tian, Tal Arbel, James J. Clark	Grow-push-prune: Aligning deep discriminants for effective structural network compression.	Comput. Vis. Image Underst.	2023	DBLP DOI BibTeX RDF
19	Max Zimmer, Megi Andoni, Christoph Spiegel 0002, Sebastian Pokutta	PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs.	CoRR	2023	DBLP DOI BibTeX RDF
19	Siyu Ren, Kenny Q. Zhu	Low-Rank Prune-And-Factorize for Language Model Compression.	CoRR	2023	DBLP DOI BibTeX RDF
19	Mauricio Diaz-Ortiz Jr., Benjamin Kempinski, Daphne Cornelisse, Yoram Bachrach, Tal Kachman	Using Cooperative Game Theory to Prune Neural Networks.	CoRR	2023	DBLP DOI BibTeX RDF
19	Yogi Prasetyo, Novanto Yudistira, Agus Wahyu Widodo	Sparse then Prune: Toward Efficient Vision Transformers.	CoRR	2023	DBLP DOI BibTeX RDF
19	Björn Deiseroth, Max Meuer, Nikolas Gritsch, Constantin Eichenberg, Patrick Schramowski, Matthias Aßenmacher, Kristian Kersting	Divergent Token Metrics: Measuring degradation to prune away LLM components - and optimize quantization.	CoRR	2023	DBLP DOI BibTeX RDF
19	Qiaozhe Zhang, Ruijie Zhang, Jun Sun 0020, Yingzhuang Liu	How Sparse Can We Prune A Deep Network: A Geometric Viewpoint.	CoRR	2023	DBLP DOI BibTeX RDF
19	Marta Milovanovic, Enzo Tartaglione, Marco Cagnazzo, Félix Henry	Learn how to Prune Pixels for Multi-view Neural Image-based Synthesis.	CoRR	2023	DBLP DOI BibTeX RDF
19	Shuangrui Ding, Peisen Zhao, Xiaopeng Zhang 0008, Rui Qian, Hongkai Xiong, Qi Tian 0001	Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation.	CoRR	2023	DBLP DOI BibTeX RDF
19	Simone Sarti, Eugenio Lomurno, Matteo Matteucci	Anticipate, Ensemble and Prune: Improving Convolutional Neural Networks via Aggregated Early Exits.	CoRR	2023	DBLP DOI BibTeX RDF
19	Eldar Kurtic, Torsten Hoefler, Dan Alistarh	How to Prune Your Language Model: Recovering Accuracy on the "Sparsity May Cry" Benchmark.	CoRR	2023	DBLP DOI BibTeX RDF
19	Natalia Flechas Manrique, Wanqian Bao, Aurélie Herbelot, Uri Hasson	Enhancing Interpretability using Human Similarity Judgements to Prune Word Embeddings.	CoRR	2023	DBLP DOI BibTeX RDF
19	Aleksandra Nowak 0001, Bram Grooten, Decebal Constantin Mocanu, Jacek Tabor	Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training.	CoRR	2023	DBLP DOI BibTeX RDF
19	I. Zakir Ahmed, Hamid R. Sadjadpour, Shahram Yousefi	An information-theoretic branch-and-prune algorithm for discrete phase optimization of RIS in massive MIMO.	CoRR	2023	DBLP DOI BibTeX RDF
19	Miroslav Rada, Elif Garajová, Jaroslav Horácek, Milan Hladík	New pruning tests for the branch-and-prune framework for interval parametric linear systems.	Soft Comput.	2023	DBLP DOI BibTeX RDF
19	Aleksandr Dekhovich, David M. J. Tax, Marcel H. F. Sluiter, Miguel A. Bessa	Continual prune-and-select: class-incremental learning with specialized subnetworks.	Appl. Intell.	2023	DBLP DOI BibTeX RDF
19	Siyu Zhou, Lucas Mentch	Trees, forests, chickens, and eggs: when and why to prune trees in a random forest.	Stat. Anal. Data Min.	2023	DBLP DOI BibTeX RDF
19	Shuangrui Ding, Peisen Zhao, Xiaopeng Zhang 0008, Rui Qian, Hongkai Xiong, Qi Tian 0001	Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation.	ICCV	2023	DBLP DOI BibTeX RDF
19	Charlie Groh, Sergej Proskurin, Apostolis Zarras	Free Willy: Prune System Calls to Enhance Software Security.	SAC	2023	DBLP DOI BibTeX RDF
19	Anirudh S. Sundar, Gokce Keskin, Chander Chandak, I-Fan Chen, Pegah Ghahremani, Shalini Ghosh	Prune Then Distill: Dataset Distillation with Importance Sampling.	ICASSP	2023	DBLP DOI BibTeX RDF
19	Simone Sarti, Eugenio Lomurno, Matteo Matteucci	Anticipate, Ensemble and Prune: Improving Convolutional Neural Networks via Aggregated Early Exits.	INNS DLIA@IJCNN	2023	DBLP DOI BibTeX RDF
19	James Fitzpatrick, Deepak Ajwani, Paula Carroll	Learning to Prune Electric Vehicle Routing Problems.	LION	2023	DBLP DOI BibTeX RDF
19	Tao Niu, Yinglei Teng, Panpan Zou, Yiding Liu	Cluster, Reconstruct and Prune: Equivalent Filter Pruning for CNNs without Fine-Tuning.	ISCC	2023	DBLP DOI BibTeX RDF
19	Tim Hotfilter, Julian Höfer, Fabian Kreß, Fabian Kempf, Leonhard Kraft, Tanja Harbaum, Jürgen Becker 0001	A Hardware-Centric Approach to Increase and Prune Regular Activation Sparsity in CNNs.	AICAS	2023	DBLP DOI BibTeX RDF
19	Marta Milovanovic, Enzo Tartaglione, Marco Cagnazzo, Félix Henry	Learn How to Prune Pixels for Multi-View Neural Image-Based Synthesis.	ICME Workshops	2023	DBLP DOI BibTeX RDF
19	Natalia Flechas Manrique, Wanqian Bao, Aurélie Herbelot, Uri Hasson	Enhancing Interpretability Using Human Similarity Judgements to Prune Word Embeddings.	BlackboxNLP@EMNLP	2023	DBLP DOI BibTeX RDF
19	Anais Boumendil, Walid Bechkit, Pierre-Edouard Portier, Frédéric Le Mouël, Malcolm Egan	Grow, prune or select data: which technique allows the most energy-efficient neural network training?	ICTAI	2023	DBLP DOI BibTeX RDF
19	Duc Hoang, Souvik Kundu 0009, Shiwei Liu, Zhangyang Wang	Don't just prune by magnitude! Your mask topology is a secret weapon.	NeurIPS	2023	DBLP BibTeX RDF
19	Aleksandra Nowak 0001, Bram Grooten, Decebal Constantin Mocanu, Jacek Tabor	Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training.	NeurIPS	2023	DBLP BibTeX RDF
19	Shayesteh Arasti, Siavash Mirarab	Optimal Subtree Prune and Regraft for Quartet Score in Sub-Quadratic Time.	WABI	2023	DBLP DOI BibTeX RDF
19	Wang Feng, Shiyang Chen, Hang Liu 0001, Yuede Ji	PeeK: A Prune-Centric Approach for K Shortest Path Computation.	SC	2023	DBLP DOI BibTeX RDF
19	Shangqian Gao, Burak Uzkent, Yilin Shen, Heng Huang, Hongxia Jin	Learning to Jointly Share and Prune Weights for Grounding Based Vision and Language Models.	ICLR	2023	DBLP BibTeX RDF