Остановите войну!
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 245 matches
- 2024
- Yiye Yang, Miao Zhang, Shihua Peng, Mingkun Ye, Yixiong Zhang:
Direction-of-Arrival Estimation for a Random Sparse Linear Array Based on a Graph Neural Network. Sensors 24(1): 91 (2024) - Manuel Fernandez V, Lutz Warnke:
The clique chromatic number of sparse random graphs. CoRR abs/2403.03013 (2024) - Hugo Jaquard, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs. CoRR abs/2403.19300 (2024) - 2023
- Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems. Algorithmica 85(9): 2817-2842 (2023) - Michael Anastos:
A Note on Long Cycles in Sparse Random Graphs. Electron. J. Comb. 30(2) (2023) - Tatsuya Koyakumaru, Masahiro Yukawa, Eduardo Pavez, Antonio Ortega:
Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(1): 23-34 (2023) - Ye Wang, Yan Li:
Randomly finding independent sets in locally sparse graphs. J. Comb. Optim. 45(1): 5 (2023) - Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee, Tuan Tran:
Majority dynamics on sparse random graphs. Random Struct. Algorithms 63(1): 171-191 (2023) - Rohan T. Money, Joshin Krishnan, Baltasar Beferull-Lozano:
Sparse Online Learning With Kernels Using Random Features for Estimating Nonlinear Dynamic Graphs. IEEE Trans. Signal Process. 71: 2027-2042 (2023) - Zirui Liu, Shengyuan Chen, Kaixiong Zhou, Daochen Zha, Xiao Huang, Xia Hu:
RSC: Accelerate Graph Neural Networks Training via Randomized Sparse Computations. ICML 2023: 21951-21968 - Isuru Ranawaka, Md. Khaledur Rahman, Ariful Azad:
Distributed Sparse Random Projection Trees for Constructing K-Nearest Neighbor Graphs. IPDPS 2023: 36-46 - Eoin Hurley, François Pirot:
Uniformly Random Colourings of Sparse Graphs. STOC 2023: 1357-1370 - Eoin Hurley, François Pirot:
Uniformly Random Colourings of Sparse Graphs. CoRR abs/2303.15367 (2023) - Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
Twin-width of sparse random graphs. CoRR abs/2312.03688 (2023) - 2022
- Valentas Kurauskas:
On local weak limit and subgraph counts for sparse random graphs. J. Appl. Probab. 59(3): 755-776 (2022) - Tomas Masak, Tomas Rubin, Victor M. Panaretos:
Inference and Computation for Sparsely Sampled Random Surfaces. J. Comput. Graph. Stat. 31(4): 1361-1374 (2022) - Xin Li, Yu Yang, Wu Zhantao, Ke Yan, Haidong Shao, Junsheng Cheng:
High-accuracy gearbox health state recognition based on graph sparse random vector functional link network. Reliab. Eng. Syst. Saf. 218(Part): 108187 (2022) - Yahav Alon, Michael Krivelevich, Eyal Lubetzky:
Cycle lengths in sparse random graphs. Random Struct. Algorithms 61(3): 444-461 (2022) - Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. Random Struct. Algorithms 61(4): 666-677 (2022) - Brett Kolesnik:
Large deviations of the greedy independent set algorithm on sparse random graphs. Random Struct. Algorithms 61(2): 353-363 (2022) - Lázaro Alberto Larrauri, Tobias Müller, Marc Noy:
Limiting probabilities of first order properties of random sparse graphs and hypergraphs. Random Struct. Algorithms 60(3): 506-526 (2022) - Frank Mousset, Nemanja Skoric, Milos Trujic:
Covering cycles in sparse graphs. Random Struct. Algorithms 60(4): 716-748 (2022) - Samantha Petti, Santosh S. Vempala:
Approximating sparse graphs: The random overlapping communities model. Random Struct. Algorithms 61(4): 844-908 (2022) - Tuan A. Do, Joshua Erde, Mihyun Kang:
Planarity and Genus of Sparse Random Bipartite Graphs. SIAM J. Discret. Math. 36(2): 1394-1415 (2022) - Asit Kumar Pradhan, Vamsi K. Amalladinne, Avinash Vem, Krishna R. Narayanan, Jean-François Chamberland:
Sparse IDMA: A Joint Graph-Based Coding Scheme for Unsourced Random Access. IEEE Trans. Commun. 70(11): 7124-7133 (2022) - Subhroshekhar Ghosh, Krishnakumar Balasubramanian, Xiaochuan Yang:
Fractal Gaussian Networks: A Sparse Random Graph Model Based on Gaussian Multiplicative Chaos. IEEE Trans. Inf. Theory 68(5): 3234-3252 (2022) - Charilaos Efthymiou:
On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs. ICALP 2022: 57:1-57:16 - Zhen-Chang Wang, Jin-Xing Liu, Junliang Shang, Ling-Yun Dai, Chun-Hou Zheng, Juan Wang:
ARGLRR: An Adjusted Random Walk Graph Regularization Sparse Low-Rank Representation Method for Single-Cell RNA-Sequencing Data Clustering. ISBRA 2022: 126-137 - Federica Zoe Ricci, Michele Guindani, Erik Sudderth:
Thinned random measures for sparse graphs with overlapping communities. NeurIPS 2022 - Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Testing thresholds for high-dimensional sparse random geometric graphs. STOC 2022: 672-677
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-04-25 13:21 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