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 19 matches
- 2023
- Haiyang Yu, Donglai Gao, Wenli Chen, Zhi Deng:
Effects of a pair of adjacent rods on circular cylinder flow. J. Vis. 26(5): 1037-1053 (2023) - 2021
- Che-Nan Kuo, Yu-Huei Cheng:
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices. Discret. Appl. Math. 294: 1-9 (2021) - Takuya Kawatani, Tsubasa Yamaguchi, Yuta Sato, Ryotaro Maita, Tsunenori Mine:
Prediction of Bus Travel Time over Intervals between Pairs of Adjacent Bus Stops Using City Bus Probe Data. Int. J. Intell. Transp. Syst. Res. 19(2): 456-467 (2021) - 2020
- Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan Wagner, Mark Daniel Ward:
The number of distinct adjacent pairs in geometrically distributed words. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - 2018
- Pongpat Sittitrai, Kittikorn Nakprasit:
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable. CoRR abs/1812.10473 (2018) - 2016
- Chao-Liang Liu, Gwoboa Horng, Du-Shiau Tsai:
Speeding up Pairing Computation Using Non-adjacent Form and ELM Method. Int. J. Netw. Secur. 18(1): 108-115 (2016) - Rodrigo S. Jamisola:
Bio-inspired holistic control for a combined four-arm robot through relative Jacobian of opposite and adjacent dual-arm pairs. BioRob 2016: 132 - 2014
- Christian Badack, Thomas Kern, Michael Gössel:
Modified DEC BCH codes for parallel correction of 3-bit errors comprising a pair of adjacent errors. IOLTS 2014: 116-121 - 2013
- R. Shreelekshmi, M. Wilscy, C. E. Veni Madhavan:
Improved LSB stegananalysis based on analysis of adjacent pixel pairs. Signal Image Video Process. 7(5): 811-816 (2013) - 2011
- Jason Yong-Jin Tee, Lay-Ki Soon, Bali Ranaivo-Malançon:
Finding Web Document Associations Using Frequent Pairs of Adjacent Words. KTW 2011: 360-363 - 2008
- Ichigaku Takigawa, Hiroshi Mamitsuka:
Probabilistic path ranking based on adjacent pairwise coexpression for metabolic transcripts analysis. Bioinform. 24(2): 250-257 (2008) - 2007
- Jacek Malinowski:
Node-pair reliability of network systems with small distances between adjacent nodes. Reliab. Eng. Syst. Saf. 92(4): 479-489 (2007) - 2006
- Tsuyoshi Takagi, David Reis Jr., Sung-Ming Yen, Bo-Ching Wu:
Radix-r Non-Adjacent Form and Its Application to Pairing-Based Cryptosystem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(1): 115-123 (2006) - Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi:
Automatic extraction of bilingual word pairs from parallel corpora with various languages using learning for adjacent information. Syst. Comput. Jpn. 37(13): 40-53 (2006) - Ki Tae Park, Young Shik Moon:
Object-Based Image Retrieval Using Dominant Color Pairs Between Adjacent Regions. ICCSA (5) 2006: 404-411 - 2005
- Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi:
Automatic Acquisition of Adjacent Information and Its Effectiveness in Extraction of Bilingual Word Pairs from Parallel Corpora. NLDB 2005: 349-352 - 2000
- Hennie De Schepper:
Finite Element Methods for Eigenvalue Problems on a Rectangle with (Semi-) Periodic Boundary Conditions on a Pair of Adjacent Sides. Computing 64(3): 191-206 (2000) - 1980
- Rudolf Ahlswede:
Simple hypergraphs with maximal number of adjacent pairs of edges. J. Comb. Theory B 28(2): 164-167 (1980) - 1975
- S. Bing Han:
Behavior of Crosstalk Loss for Adjacent Pairs at Low Frequencies. IEEE Trans. Commun. 23(9): 956-962 (1975)
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-09-24 02:08 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