Остановите войну!
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 495 matches
- 2024
- Peiquan Jin, Zhaole Chu, Gaocong Liu, Yongping Luo, Shouhong Wan:
Optimizing B+-tree for hybrid memory with in-node hotspot cache and eADR awareness. Frontiers Comput. Sci. 18(5): 185606 (2024) - Francesco Daghero, Alessio Burrello, Enrico Macii, Paolo Montuschi, Massimo Poncino, Daniele Jahier Pagliari:
Dynamic Decision Tree Ensembles for Energy-Efficient Inference on IoT Edge Nodes. IEEE Internet Things J. 11(1): 742-757 (2024) - Yang Yang, Shengbo Hu, Guiju Lu:
Dynamic Caching Routing Strategy for LEO Satellite Nodes Based on Gradient Boosting Regression Tree. J. Inf. Process. Syst. 20(1): 131-147 (2024) - Wei Wei, Qiuyuan Hu, Qinghui Zhang:
Improving node connectivity by optimized dual tree-based effective node consolidation. Reliab. Eng. Syst. Saf. 242: 109747 (2024) - Yuanzhe Jin, Tim J. A. de Jong, Martijn Tennekes, Min Chen:
Radial Icicle Tree (RIT): Node Separation and Area Constancy. IEEE Trans. Vis. Comput. Graph. 30(1): 251-261 (2024) - Wouter W. L. Nuijten, Vlado Menkovski:
Node Classification in Random Trees. IDA (1) 2024: 105-116 - Tianxiang Dai, Yufan Jiang, Yong Li, Fei Mei:
NodeGuard: A Highly Efficient Two-Party Computation Framework for Training Large-Scale Gradient Boosting Decision Tree. IACR Cryptol. ePrint Arch. 2024: 535 (2024) - 2023
- Marco Di Summa, Syed Md Omar Faruk:
Critical node/edge detection problems on trees. 4OR 21(3): 439-455 (2023) - Bo-Hyun Lee, Mijin An, Sang-Won Lee:
A Case for Space Compaction of B-Tree Nodes on Flash Storage. IEEE Access 11: 38149-38156 (2023) - Zhenyu Tian, Jiali You, Linlin Hu:
A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method. Future Internet 15(5): 156 (2023) - Wenjun Zhou, Jianmin Ma:
Influence of tree-based multi-layer node information on scoring accuracy and speed of speaker verification. J. Intell. Fuzzy Syst. 45(6): 11601-11611 (2023) - Boyu Yang, Weiguo Zheng:
Near-optimal Steiner tree computation powered by node embeddings. Knowl. Inf. Syst. 65(11): 4563-4583 (2023) - Xinyu Du, Xingyi Zhang, Sibo Wang, Zengfeng Huang:
Efficient Tree-SVD for Subset Node Embedding over Large Dynamic Graphs. Proc. ACM Manag. Data 1(1): 96:1-96:26 (2023) - Nicolas Boria, Jana Kiederle, Florian Yger, David B. Blumenthal:
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees. Pattern Recognit. Lett. 167: 189-195 (2023) - Ziyang Shen, Chaoming Fang, Fengshi Tian, Jie Yang, Mohamad Sawan:
PN-TMS: Pruned Node-fusion Tree-based Multicast Scheme for Efficient Neuromorphic Systems. AICAS 2023: 1-5 - Swee Chuan Tan:
Enhancing Regression Tree Predictions with Terminal-Node Anomaly Detection. AICCC 2023: 21-26 - Ping Chen, Jingjing Hu, Zhitao Wu, Ruoting Xiong, Wei Ren:
MergeTree: a Tree Model with Merged Nodes for Threat Induction. CACML 2023: 49-53 - Marina de la Cruz López, Oscar Garnica, José Ignacio Hidalgo:
Tree-Based Grammatical Evolution with Non-Encoding Nodes. GECCO Companion 2023: 63-64 - Yan Zhao, Qiang Wang, Xiaofeng Chen:
Optimizing Blockchain Broadcast with Node-Cluster Tree Routing. ICSAI 2023: 1-6 - Kai Pfeiffer, Leonardo Edgar, Quang-Cuong Pham:
Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal Task Planning. IROS 2023: 8255-8261 - Lianwei Qu, Yong Wang, Jing Yang:
Critical Node Privacy Protection Based on Random Pruning of Critical Trees. KSEM (1) 2023: 51-58 - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. DISC 2023: 7:1-7:21 - Kai Pfeiffer, Leonardo Edgar, Quang-Cuong Pham:
Monte-Carlo Tree Search with Prioritized Node Expansion for Multi-Goal Task Planning. CoRR abs/2303.04518 (2023) - Francesco Daghero, Alessio Burrello, Enrico Macii, Paolo Montuschi, Massimo Poncino, Daniele Jahier Pagliari:
Dynamic Decision Tree Ensembles for Energy-Efficient Inference on IoT Edge Nodes. CoRR abs/2306.09789 (2023) - Yuanzhe Jin, Tim J. A. de Jong, Martijn Tennekes, Min Chen:
Radial Icicle Tree (RIT): Node Separation and Area Constancy. CoRR abs/2307.10481 (2023) - Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid:
On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR abs/2308.04251 (2023) - Wouter W. L. Nuijten, Vlado Menkovski:
Node classification in random trees. CoRR abs/2311.12167 (2023) - Kennedy E. Ehimwenma, Junfeng Wang, Ze Zheng, Hongyu Zhou:
A symbolic-arithmetic for teaching double-black node removal in red-black trees. CoRR abs/2312.07566 (2023) - Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu:
On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest. CoRR abs/2312.11540 (2023) - 2022
- Ezzat Mohammad Nezhad, Mehri Javanian, Ramin Imany-Nabiyyi:
Weakly protected nodes in random binary search trees. RAIRO Theor. Informatics Appl. 56: 2 (2022)
skipping 465 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-27 01:28 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