Остановите войну!
for scientists:
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 26 matches
- 2023
- Gewu Bu, Zvi Lotker, Maria Potop-Butucaru, Mikaël Rabie:
Lower and upper bounds for deterministic convergecast with labeling schemes. Theor. Comput. Sci. 952: 113775 (2023) - 2022
- Yacov Satin, Rostislav V. Razumchik, Alexander I. Zeifman, I. A. Kovalev:
Upper bound on the rate of convergence and truncation bound for non-homogeneous birth and death processes on Z. Appl. Math. Comput. 423: 127009 (2022) - Emily Zhang, Jiajia Zhao, Nancy A. Lynch:
An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies. J. Comput. Biol. 29(4): 344-357 (2022) - Etienne de Klerk, Monique Laurent:
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. 193(2): 665-685 (2022) - Lucas Slot, Monique Laurent:
Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets. Math. Program. 193(2): 831-871 (2022) - Parijat Prasun, Sunidhi Pandey, Shyam Kamal, Sandip Ghosh, Devender Singh, Debdas Ghosh:
Predefined Upper Bound of Settling Time based Convergent Gradient Flow Systems. IECON 2022: 1-6 - 2021
- Christian Füllner, Peter Kirst, Oliver Stein:
Convergent upper bounds in global minimization with nonlinear equality constraints. Math. Program. 187(1): 617-651 (2021) - Krzysztof Wójcik, Tomasz Kulpa, Krzysztof Trojanowski:
Upper Bounds for Particle Location Variance Convergence Measures in the Stochastic Model of Particle Swarm. CEC 2021: 1341-1348 - 2020
- Graziano Chesi, Tiantian Shen:
Convergent upper bounds of peak response of LTI and polytopic LTV systems through LMIs. Autom. 122: 109260 (2020) - Yujie Zhao, Xiaoming Huo:
A Homotopic Method to Solve the Lasso Problems with an Improved Upper Bound of Convergence Rate. CoRR abs/2010.13934 (2020) - 2019
- Kui Du:
Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss-Seidel algorithms. Numer. Linear Algebra Appl. 26(3) (2019) - 2017
- Etienne de Klerk, Monique Laurent, Zhao Sun:
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. Math. Program. 162(1-2): 363-392 (2017) - Jung Hoon Kim, Tomomichi Hagiwara:
Upper/lower bounds of generalized H2 norms in sampled-data systems with convergence rate analysis and discretization viewpoint. Syst. Control. Lett. 107: 28-35 (2017) - Etienne de Klerk, Roxana Hess, Monique Laurent:
Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization. SIAM J. Optim. 27(1): 347-367 (2017) - 2015
- M. R. Renu, Subhasis Chaudhuri, Rajbabu Velmurugan:
Convergence analysis of a quadratic upper bounded TV regularizer based blind deconvolution. Signal Process. 106: 174-183 (2015) - Shang Shang, Paul Cuff, Pan Hui, Sanjeev R. Kulkarni:
An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs. IEEE Trans. Autom. Control. 60(4): 1127-1132 (2015) - 2014
- Cui Guo, Hua Xiang:
A note on the upper bound in SA AMG convergence analysis. Numer. Linear Algebra Appl. 21(3): 399-402 (2014) - Shang Shang, Paul W. Cuff, Pan Hui, Sanjeev R. Kulkarni:
An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs. CoRR abs/1409.6828 (2014) - 2013
- Shang Shang, Paul W. Cuff, Pan Hui, Sanjeev R. Kulkarni:
An upper bound on the convergence time for quantized consensus. INFOCOM 2013: 600-604 - 2012
- Shang Shang, Paul W. Cuff, Sanjeev R. Kulkarni, Pan Hui:
An upper bound on the convergence time for distributed binary consensus. FUSION 2012: 369-375 - Shang Shang, Paul W. Cuff, Sanjeev R. Kulkarni, Pan Hui:
An Upper Bound on the Convergence Time for Distributed Binary Consensus. CoRR abs/1208.0525 (2012) - Shang Shang, Paul W. Cuff, Pan Hui, Sanjeev R. Kulkarni:
An Upper Bound on the Convergence Time for Quantized Consensus. CoRR abs/1208.0788 (2012) - 2008
- George S. Lueker:
On the Convergence of Upper Bound Techniques for the Average Length of Longest Common Subsequences. ANALCO 2008: 169-182 - 2006
- Minghua Chen, David N. C. Tse:
An upper bound on the convergence rate of uplink power control in DS-CDMA systems. IEEE Commun. Lett. 10(4): 231-233 (2006) - 1998
- Avram Sidi, Yair Shapira:
Upper bounds for convergence rates of acceleration methods with initial iterations. Numer. Algorithms 18(2): 113-132 (1998) - 1973
- P. Boukris:
An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions (Corresp.). IEEE Trans. Inf. Theory 19(5): 708-709 (1973)
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-04-25 09:43 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