Остановите войну!
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 252 matches
- 2024
- Lunshan Gao:
Finding local Max-Cut in graphs in randomized polynomial time. Soft Comput. 28(4): 3029-3048 (2024) - Alexandre Benatti, Luciano da F. Costa:
Hierarchical Cutting of Complex Networks Performed by Random Walks. CoRR abs/2403.06876 (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) - Evita Nestoridi, Peter Sarnak:
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs. Comb. 43(2): 367-384 (2023) - Michael Drmota, Marc Noy, Benedikt Stufler:
Cut Vertices in Random Planar Maps. Electron. J. Comb. 30(3) (2023) - Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar:
One-dimensional stock cutting resilient against singular random defects. Comput. Oper. Res. 157: 106280 (2023) - Zijuan Pang, Jianming Cen, Ming Yi:
Unsupervised concept drift detection method based on robust random cut forest. Int. J. Mach. Learn. Cybern. 14(12): 4207-4222 (2023) - Jake S. Rhodes, Adele Cutler, Kevin R. Moon:
Geometry- and Accuracy-Preserving Random Forest Proximities. IEEE Trans. Pattern Anal. Mach. Intell. 45(9): 10947-10959 (2023) - Angus Lowe, Matija Medvidovic, Anthony Hayes, Lee J. O'Riordan, Thomas R. Bromley, Juan Miguel Arrazola, Nathan Killoran:
Fast quantum circuit cutting with randomized measurements. Quantum 7: 934 (2023) - Ahmed El Alaoui, Andrea Montanari, Mark Sellke:
Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree. Random Struct. Algorithms 63(3): 689-715 (2023) - Antonio Gianmaria Spampinato, Rocco A. Scollo, Vincenzo Cutello, Mario Pavone:
Random search immune algorithm for community detection. Soft Comput. 27(12): 8061-8090 (2023) - Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. NeurIPS 2023 - Konstantin Makarychev, Liren Shan:
Random Cuts are Optimal for Explainable k-Medians. CoRR abs/2304.09113 (2023) - Sudhanshu Chanpuriya, Cameron Musco:
Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More. CoRR abs/2308.06448 (2023) - Dmitry Sokolov:
Random (log n)-CNF are Hard for Cutting Planes (Again). Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Sansei Hori, Hakaru Tamukoh:
An Implementation Method Using Cut-Off Bits for Restricted Boltzmann Machines Without Random Number Generators. IEEE Access 10: 42791-42801 (2022) - Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69(3): 19:1-19:32 (2022) - Aikaterini Aretaki, Efthymios N. Karatzas:
Random geometries for optimal control PDE problems based on fictitious domain FEMs and cut elements. J. Comput. Appl. Math. 412: 114286 (2022) - Miguel Angel Pérez-Cutiño, Fabio Rodríguez, L. D. Pascual, José Miguel Díaz-Báñez:
Ornithopter Trajectory Optimization with Neural Networks and Random Forest. J. Intell. Robotic Syst. 105(1): 17 (2022) - Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei, Gregory B. Sorkin:
The Ising Antiferromagnet and Max Cut on Random Regular Graphs. SIAM J. Discret. Math. 36(2): 1306-1342 (2022) - Lei Zhu, Xuejing Kang, Lizhu Ye, Anlong Ming:
Explored Normalized Cut With Random Walk Refining Term for Image Segmentation. IEEE Trans. Image Process. 31: 2893-2906 (2022) - Othmane Sebbouh, Marco Cuturi, Gabriel Peyré:
Randomized Stochastic Gradient Descent Ascent. AISTATS 2022: 2941-2969 - Fabian Burghart:
A Modification of the Random Cutting Model. AofA 2022: 4:1-4:14 - Apostolos Chalkis, Christina Katsamaki, Josué Tonelli-Cueto:
On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves. ISSAC 2022: 273-282 - Jake S. Rhodes, Adele Cutler, Kevin R. Moon:
Geometry- and Accuracy-Preserving Random Forest Proximities. CoRR abs/2201.12682 (2022) - Sijin Yeom, Jae-Hun Jung:
Weighted Random Cut Forest Algorithm for Anomaly Detections. CoRR abs/2202.01891 (2022) - Harsh Vardhan, Janos Sztipanovits:
Reduced Robust Random Cut Forest for Out-Of-Distribution detection in machine learning models. CoRR abs/2206.09247 (2022) - Anand Louis, Rameesh Paul, Arka Ray:
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. CoRR abs/2212.13406 (2022) - 2021
- Gabriel Berzunza Ojeda, Xing Shi Cai, Cecilia Holmgren:
The $k$-Cut Model in Deterministic and Random Trees. Electron. J. Comb. 28(1): 1 (2021) - Ammar H. Elsheikh, Taher A. Shehabeldeen, Jianxin Zhou, Ezzat Showaib, Mohamed E. Abd Elaziz:
Prediction of laser cutting parameters for polymethylmethacrylate sheets using random vector functional link network integrated with equilibrium optimizer. J. Intell. Manuf. 32(5): 1377-1388 (2021)
skipping 222 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 18:22 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