Остановите войну!
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 291 matches
- 2024
- Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - 2023
- Yao Wu, Donghua Zhu, Xuefeng Wang:
Tree enhanced deep adaptive network for cancer prediction with high dimension low sample size microarray data. Appl. Soft Comput. 136: 110078 (2023) - Jordi Gené-Mola, Mar Ferrer-Ferrer, Eduard Gregorio-Lopez, Pieter M. Blok, Jochen Hemming, Josep Ramon Morros, Joan Ramón Rosell-Polo, Verónica Vilaplana, Javier Ruiz Hidalgo:
Looking behind occlusions: A study on amodal segmentation for robust on-tree apple fruit size estimation. Comput. Electron. Agric. 209: 107854 (2023) - Svetlana Kulagina, Henning Meyerhenke, Anne Benoit:
Mapping tree-shaped workflows on systems with different memory sizes and processor speeds. Concurr. Comput. Pract. Exp. 35(25) (2023) - Zhenbang Hao, Lili Lin, Christopher J. Post, Elena A. Mikhailova, Kunyong Yu, Huirong Fang, Jian Liu:
The co-effect of image resolution and crown size on deep learning for individual tree detection and delineation. Int. J. Digit. Earth 16(1): 3753-3771 (2023) - Alexey V. Gulyaev, Mikhail V. Tamm:
Path Counting on Tree-like Graphs with a Single Entropic Trap: Critical Behavior and Finite Size Effects. Entropy 25(9): 1318 (2023) - Santanu S. Dey, Yatharth Dubey, Marco Molinaro:
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198(1): 539-559 (2023) - Xujun Ye, Marin Kitaya, Shiori Abe, Fanxing Sheng, Shuhuai Zhang:
A New Small-Size Camera with Built-In Specific-Wavelength LED Lighting for Evaluating Chlorophyll Status of Fruit Trees. Sensors 23(10): 4636 (2023) - Konstantinos Panagiotou, Leon Ramzews, Benedikt Stufler:
Exact-Size Sampling of Enriched Trees in Linear Time. SIAM J. Comput. 52(5): 1097-1131 (2023) - Michael Fuchs, Tsan-Cheng Yu:
Asymptotic normality for the size of graph tries built from M-ary tree labelings. Theor. Comput. Sci. 968: 114011 (2023) - Chang Han, Jaemin Jo, Anyi Li, Bongshin Lee, Oliver Deussen, Yunhai Wang:
SizePairs: Achieving Stable and Balanced Temporal Treemaps using Hierarchical Size-based Pairing. IEEE Trans. Vis. Comput. Graph. 29(1): 193-202 (2023) - Andrew Fregly, Joseph Harvey, Burton S. Kaliski Jr., Swapneel Sheth:
Merkle Tree Ladder Mode: Reducing the Size Impact of NIST PQC Signature Algorithms in Practice. CT-RSA 2023: 415-441 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA 2023: 66:1-66:16 - Aphilak Lonklang, János Botzheim:
A Rapidly-Exploring Random Tree Algorithm with Reduced Random Map Size. ICARA 2023: 356-361 - Size Zheng, Siyuan Chen, Siyuan Gao, Liancheng Jia, Guangyu Sun, Runsheng Wang, Yun Liang:
TileFlow: A Framework for Modeling Fusion Dataflow via Tree-based Analysis. MICRO 2023: 1271-1288 - Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal:
Randomized versus Deterministic Decision Tree Size. STOC 2023: 867-880 - Tomoki Anzai, Moju Zhao, Fan Shi, Kei Okada, Masayuki Inaba:
Sensing and Navigation of Aerial Robot for Measuring Tree Location and Size in Forest Environment. CoRR abs/2302.05858 (2023) - Edossa Merga Terefe:
Tree-Based Machine Learning Methods For Vehicle Insurance Claims Size Prediction. CoRR abs/2302.10612 (2023) - Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR abs/2306.17065 (2023) - Charles Peyrat, Paul Gallot, Sebastian Maneth, Keisuke Nakano:
Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers. CoRR abs/2307.16500 (2023) - Liding Zhang, Zhenshan Bing, Kejia Chen, Lingyun Chen, Fan Wu, Peter Krumbholz, Zhilin Yuan, Sami Haddadin, Alois Knoll:
Flexible Informed Trees (FIT*): Adaptive Batch-Size Approach for Informed Sampling-Based Planner. CoRR abs/2310.12828 (2023) - 2022
- Murat Karakoyun, Ahmet Özkis:
A binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problems. Appl. Soft Comput. 129: 109590 (2022) - Shengyuan Feng, Junqing Gong, Jie Chen:
Binary Tree Encryption with Constant-Size Public Key in the Standard Model. Comput. J. 65(6): 1489-1511 (2022) - Gregor Hendel, Daniel Anderson, Pierre Le Bodic, Marc E. Pfetsch:
Estimating the Size of Branch-and-Bound Trees. INFORMS J. Comput. 34(2): 934-952 (2022) - Santanu S. Dey, Prachi Shah:
Lower bound on size of branch-and-bound trees for solving lot-sizing problem. Oper. Res. Lett. 50(5): 430-433 (2022) - JangHo Bae, Sumin Park, Mark Yim, TaeWon Seo:
Polygon-Based Random Tree Search Algorithm for a Size-Changing Robot. IEEE Robotics Autom. Lett. 7(3): 8100-8105 (2022) - Gabriel Berzunza, Cecilia Holmgren:
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. Random Struct. Algorithms 60(4): 631-652 (2022) - Zinnia Sultana, Lutfun Nahar, Farzana Tasnim, Mohammad Shahadat Hossain, Karl Andersson:
An Encoding and Decoding Technique to Compress Huffman Tree Size in an Efficient Manner. ICO 2022: 863-873 - Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). IPEC 2022: 22:1-22:23
skipping 261 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-05-11 12:39 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