Остановите войну!
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 24 matches
- 2023
- Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang, Wenling Zhou:
Tiling multipartite hypergraphs in quasi-random hypergraphs. J. Comb. Theory, Ser. B 160: 36-65 (2023) - Shunxing Bao, Ho Hin Lee, Qi Yang, Lucas Walker Remedios, Ruining Deng, Can Cui, Leon Yichen Cai, Kaiwen Xu, Xin Yu, Sophie Chiron, Yike Li, Nathan Heath Patterson, Yaohong Wang, Jia Li, Qi Liu, Ken S. Lau, Joseph T. Roland, Lori A. Coburn, Keith T. Wilson, Bennett A. Landman, Yuankai Huo:
Alleviating tiling effect by random walk sliding window in high-resolution histological whole slide image synthesis. MIDL 2023: 1406-1422 - 2022
- Mathias Hauptmann, Ronja Tiling:
Randomized Approximation Schemes for the Tutte Polynomial and Random Clustering in Subdense and Superdense Graphs. CoRR abs/2208.13809 (2022) - 2021
- Steven Hoehner, Gil Kur:
A Concentration Inequality for Random Polytopes, Dirichlet-Voronoi Tiling Numbers and the Geometric Balls and Bins Problem. Discret. Comput. Geom. 65(3): 730-763 (2021) - Jie Han, Patrick Morris, Andrew Treglown:
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu. Random Struct. Algorithms 58(3): 480-516 (2021) - 2020
- Rajko Nenadov, Nemanja Skoric:
On Komlós' tiling theorem in random graphs. Comb. Probab. Comput. 29(1): 113-127 (2020) - Miguel A. Molina-Cabello, David A. Elizondo, Rafael M. Luque-Baena, Ezequiel López-Rubio:
Foreground detection by ensembles of random polygonal tilings. Expert Syst. Appl. 161: 113518 (2020) - 2019
- József Balogh, Andrew Treglown, Zsolt Adam Wagner:
Tilings in Randomly Perturbed Dense Graphs. Comb. Probab. Comput. 28(2): 159-176 (2019) - 2018
- Fady Massarwi, Jinesh Machchhar, Pablo Antolin, Gershon Elber:
Hierarchical, random and bifurcation tiling with heterogeneity in micro-structures construction via functional composition. Comput. Aided Des. 102: 148-159 (2018) - Sarah Cannon, Sarah Miracle, Dana Randall:
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections. SIAM J. Discret. Math. 32(3): 1966-1992 (2018) - David Keating, Ananth Sridhar:
Random Tilings with the GPU. CoRR abs/1804.07250 (2018) - 2017
- Sarah Cannon, David A. Levin, Alexandre Stauffer:
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. APPROX-RANDOM 2017: 34:1-34:21 - Tong Wang, Reiji Suda:
Fast maximal Poisson-disk sampling by randomized tiling. High Performance Graphics 2017: 16:1-16:10 - 2016
- Alexandra Ugolnikova:
Pavages Aléatoires. (Random Tilings). Sorbonne Paris Cité University, France, 2016 - Le-le Cao, Kotagiri Ramamohanarao, Fuchun Sun, Hongbo Li, Wen-bing Huang, Zay Maung Maung Aye:
Efficient Spatio-Temporal Tactile Object Recognition with Randomized Tiling Convolutional Networks in a Hierarchical Fusion Strategy. AAAI 2016: 3337-3345 - 2015
- Sarah Cannon, Sarah Miracle, Dana Randall:
Phase Transitions in Random Dyadic Tilings and Rectangular Dissections. SODA 2015: 1573-1589 - 2010
- Paul N. Balister, Béla Bollobás:
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010) - 2009
- Zihong Fan, Antonio Ortega, Cheng-hao Chien:
Overlapped Tiling for Fast Random Oblique Plane Access of 3D Object Datasets. DCC 2009: 163-172 - Daniel Fulger, Guido Germano:
Automatic generation of non-uniform random variates for arbitrary pointwise computable probability densities by tiling. CoRR abs/0902.3088 (2009) - 2005
- Paul N. Balister, Béla Bollobás, Anthony Quas:
Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005) - 2003
- Ali Shokoufandeh, Yi Zhao:
Proof of a tiling conjecture of Komlós. Random Struct. Algorithms 23(2): 180-205 (2003) - 2002
- Svante Janson, Dana Randall, Joel Spencer:
Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002) - 2001
- Nicolas Destainville:
Mixing Times of Plane Random Rhombus Tilings. DM-CCG 2001: 1-22 - 2000
- Dana Randall, Gary D. Yngve:
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings. SODA 2000: 636-645
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 07:36 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