default search action
BibTeX records: Ze Feng
@article{DBLP:journals/pr/YangFWLZQXY23, author = {Sen Yang and Ze Feng and Zhicheng Wang and Yanjie Li and Shoukui Zhang and Zhibin Quan and Shutao Xia and Wankou Yang}, title = {Detecting and grouping keypoints for multi-person pose estimation using instance-aware attention}, journal = {Pattern Recognit.}, volume = {136}, pages = {109232}, year = {2023}, url = {https://doi.org/10.1016/j.patcog.2022.109232}, doi = {10.1016/J.PATCOG.2022.109232}, timestamp = {Tue, 18 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pr/YangFWLZQXY23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/vc/WangWKFZL23, author = {Xingmei Wang and Jinli Wang and Minyang Kang and Ze Feng and Xuan Zhou and Bo Liu}, title = {LDGC-Net: learnable descriptor graph convolutional network for image retrieval}, journal = {Vis. Comput.}, volume = {39}, number = {12}, pages = {6639--6653}, year = {2023}, url = {https://doi.org/10.1007/s00371-022-02753-2}, doi = {10.1007/S00371-022-02753-2}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/vc/WangWKFZL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-10430, author = {Jiang{-}Tian Zhai and Ze Feng and Jinhao Du and Yongqiang Mao and Jiang{-}Jiang Liu and Zichang Tan and Yifu Zhang and Xiaoqing Ye and Jingdong Wang}, title = {Rethinking the Open-Loop Evaluation of End-to-End Autonomous Driving in nuScenes}, journal = {CoRR}, volume = {abs/2305.10430}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.10430}, doi = {10.48550/ARXIV.2305.10430}, eprinttype = {arXiv}, eprint = {2305.10430}, timestamp = {Wed, 24 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-10430.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LiFZGY09, author = {Minming Li and Ze Feng and Nan Zang and Ronald L. Graham and Frances F. Yao}, title = {Approximately optimal trees for group key management with batch updates}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {11}, pages = {1013--1021}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2008.10.034}, doi = {10.1016/J.TCS.2008.10.034}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/LiFZGY09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChenFLY08, author = {Zhi{-}Zhong Chen and Ze Feng and Minming Li and F. Frances Yao}, title = {Optimizing deletion cost for secure multicast key management}, journal = {Theor. Comput. Sci.}, volume = {401}, number = {1-3}, pages = {52--61}, year = {2008}, url = {https://doi.org/10.1016/j.tcs.2008.03.016}, doi = {10.1016/J.TCS.2008.03.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChenFLY08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/LiFGY07, author = {Minming Li and Ze Feng and Ronald L. Graham and Frances F. Yao}, editor = {Jin{-}yi Cai and S. Barry Cooper and Hong Zhu}, title = {Approximately Optimal Trees for Group Key Management with Batch Updates}, booktitle = {Theory and Applications of Models of Computation, 4th International Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4484}, pages = {284--295}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-72504-6\_26}, doi = {10.1007/978-3-540-72504-6\_26}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tamc/LiFGY07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.