default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 245 matches
- 2024
- Mina Asgarian, Kamal Jamshidi, Ali Bohlooli:
An Efficient Approximation Algorithm for Service Function Chaining Placement in Edge-Cloud Computing Industrial Internet of Things. IEEE Internet Things J. 11(7): 12815-12822 (2024) - Aaron Melman:
An efficient approximation to the Cauchy radius. Numer. Algorithms 96(1): 1-11 (2024) - Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks. IEEE Trans. Cloud Comput. 12(1): 116-129 (2024) - Zhongzheng Tang, Jingwen Chen, Chenhao Wang:
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. Theor. Comput. Sci. 984: 114320 (2024) - Rahul A. Patil, Pramod D. Patil:
Efficient approximation and privacy preservation algorithms for real time online evolving data streams. World Wide Web (WWW) 27(1): 5 (2024) - Ian Davidson, Michael J. Livanos, Antoine Gourru, Peter B. Walker, Julien Velcin, S. S. Ravi:
An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms. SDM 2024: 46-54 - Chuanfu Xiao, Zeyu Li, Chao Yang:
HOSCF: Efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors. CoRR abs/2403.01778 (2024) - Jeremy E. Cohen, Valentin Leplat:
Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models. CoRR abs/2403.18517 (2024) - Huicong Zhong, Xiaobing Feng:
An efficient implementation algorithm for quasi-Monte Carlo approximations of high-dimensional integrals. CoRR abs/2404.08867 (2024) - 2023
- Xiaohu Wu, Patrick Loiseau:
Efficient approximation algorithms for scheduling moldable tasks. Eur. J. Oper. Res. 310(1): 71-83 (2023) - Bolong Zhang, Michael Mascagni:
Pass-efficient randomized LU algorithms for computing low-rank matrix approximation. Monte Carlo Methods Appl. 29(3): 181-202 (2023) - Xuanyue Shentu, Xiaoping Lai, Tianlei Wang, Jiuwen Cao:
Efficient ADMM-Based Algorithm for Regularized Minimax Approximation. IEEE Signal Process. Lett. 30: 210-214 (2023) - Jiong Cai, Rui Wang, Muyang Li, Sheng Liu, Yujia Yan, Cheng Hu:
An Efficient Threshold Determination Algorithm for DP-TBD Based on Structural Analogy and Saddle-Point Approximation. IEEE Trans. Aerosp. Electron. Syst. 59(6): 8263-8281 (2023) - Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia:
Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. COCOA (1) 2023: 287-299 - Thanh Nguyen-Tang, Raman Arora:
VIPeR: Provably Efficient Algorithm for Offline RL with Neural Function Approximation. ICLR 2023 - Shiqi Zhang, Renchi Yang, Jing Tang, Xiaokui Xiao, Bo Tang:
Efficient Approximation Algorithms for Spanning Centrality. KDD 2023: 3386-3395 - Hamed Nasiri, Cheng Li, Lihong Zhang:
A Power-Efficient Successive Approximation Algorithm for Low-Activity Signals. PRIME 2023: 265-268 - Ke Zhang, Xiaoqing Wang, Gong Cheng:
Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem. WWW 2023: 199-209 - Konstantinos Ameranis, Antares Chen, Lorenzo Orecchia, Erasmo Tani:
Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. CoRR abs/2301.08920 (2023) - Shiqi Zhang, Renchi Yang, Jing Tang, Xiaokui Xiao, Bo Tang:
Efficient Approximation Algorithms for Spanning Centrality. CoRR abs/2305.16086 (2023) - Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks. CoRR abs/2306.02293 (2023) - Chi-Yeh Chen:
Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time. CoRR abs/2307.04107 (2023) - 2022
- Arvind K. Saibaba, Rachel Minster, Misha E. Kilmer:
Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions. Adv. Comput. Math. 48(5): 66 (2022) - Xuening Gao, Longkun Guo, Kewen Liao:
Efficient approximation algorithms for offline and online unit disk multiple coverage. Comput. Electr. Eng. 104(Part): 108444 (2022) - Hareesh V., T. S. Bindiya:
Design of Hardware Efficient Reconfigurable Merged Partial Cosine Modulated Non-uniform Filter Bank Channelizer and its Power Efficient Implementation Using a Novel Approximation Algorithm. Circuits Syst. Signal Process. 41(4): 2118-2135 (2022) - Francesco Marchetti, Emma Perracchione:
Efficient Reduced Basis Algorithm (ERBA) for Kernel-Based Approximation. J. Sci. Comput. 91(2): 41 (2022) - Dan He, Thomas Zhou, Xiaofang Zhou, Jiwon Kim:
An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee. IEEE Trans. Intell. Transp. Syst. 23(12): 24031-24043 (2022) - Ilias Diakonikolas, Chrystalla Pavlou, John Peebles, Alistair Stewart:
Efficient Approximation Algorithms for the Inverse Semivalue Problem. AAMAS 2022: 354-362 - Daniel Beaglehole:
An Efficient Approximation Algorithm for the Colonel Blotto Game. CoRR abs/2201.10758 (2022) - Lior Eldar, Sean Hallgren:
An efficient quantum algorithm for lattice problems achieving subexponential approximation factor. CoRR abs/2201.13450 (2022)
skipping 215 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-25 14:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint