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 23 matches
- 2025
- Zihang Jia
, Junsheng Qiao
, Minghao Chen
:
Multi-level discrimination index for intuitionistic fuzzy coverings and its applications in feature selection. Expert Syst. Appl. 263: 125735 (2025) - 2024
- Zhehuang Huang
, Jinjin Li
:
Noise-Tolerant Discrimination Indexes for Fuzzy γ Covering and Feature Subset Selection. IEEE Trans. Neural Networks Learn. Syst. 35(1): 609-623 (2024) - 2023
- Ryan E. Dougherty
, Kristoffer Kleine, Michael Wagner
, Charles J. Colbourn, Dimitris E. Simos
:
Algorithmic methods for covering arrays of higher index. J. Comb. Optim. 45(1): 28 (2023) - Gang Qin, Junjun Zheng, Tatsuhiro Tsuchiya:
Meta-Heuristic Algorithm for Constructing Higher-Index Covering Arrays for Combinatorial Interaction Testing. ICSTW 2023: 190-196 - 2022
- Michal Kvet:
Covering Undefined and Untrusted Values by the Database Index. WorldCIST (3) 2022: 473-483 - Ryan E. Dougherty
:
An Asymptotically Optimal Bound for Covering Arrays of Higher Index. CoRR abs/2211.01209 (2022) - 2021
- Andrés Gersnoviez
, Iluminada Baturone
:
Rule Simplification Method Based on Covering Indexes for Fuzzy Classifiers. FUZZ-IEEE 2021: 1-6 - 2020
- Tao Sun, Hongbo Liu
, Seán F. McLoone, Shaoxiong Ji
, Xindong Wu:
Time series indexing by dynamic covering with cross-range constraints. VLDB J. 29(6): 1365-1384 (2020) - 2018
- Donghui Zhang:
Covering Index. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- (Withdrawn) The Optimality of Partial Clique Covering for Index Coding. CoRR abs/1701.06181 (2017)
- 2010
- Eldar Giladi, John Healy, Gene Myers, Chris Hart, Philipp Kapranov, Doron Lipson, Steve Roels, Edward C. Thayer, Stan Letovsky:
Error Tolerant Indexing and Alignment of Short Reads with Covering Template Families. J. Comput. Biol. 17(10): 1397-1411 (2010) - 2009
- Donghui Zhang:
Covering Index. Encyclopedia of Database Systems 2009: 516-517 - 2005
- Zhenhui Shen, Srinivas Aluru, Srikanta Tirthapura:
Indexing for Subscription Covering in Publish-Subscribe Systems. PDCS 2005: 328-333 - 2004
- Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu:
Indexing Continual Range Queries with Covering Tiles for Fast Locating of Moving Objects. ICDCS Workshops 2004: 470-475 - Jihua Wang, Wenjiang Huang, Liangyun Liu, Chunjiang Zhao, Zhihong Ma:
Prediction of soil irrigation demanding condition under vegetation covering by proper vegetation index. IGARSS 2004: 4048-4051 - 2003
- Prakash Ramanan:
Covering Indexes for XML Queries: Bisimulation - Simulation = Negation. VLDB 2003: 165-176 - 2002
- Ahmed M. Assaf, H. Alhalees, L. P. S. Singh:
Directed Covering with Block Size 5 and Index Odd. Electron. Notes Discret. Math. 11: 30-52 (2002) - Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth:
Covering indexes for branching path queries. SIGMOD Conference 2002: 133-144 - 1998
- Ahmed M. Assaf:
Directed covering with block size 5 and index even. Discret. Math. 188(1-3): 27-40 (1998) - 1997
- Ahmed M. Assaf, L. P. S. Singh:
On covering designs with block size 5 and index 11≤λ≤21: the case v≡0(mod 4). Australas. J Comb. 15: 91-122 (1997) - 1995
- Ahmed M. Assaf:
On Covering Designs with Block Size 5 and Index 5. Des. Codes Cryptogr. 5(2): 91-107 (1995) - 1991
- Charles Delorme, Patrick Solé:
Diameter, Covering Index, Covering Radius and Eigenvalues. Eur. J. Comb. 12(2): 95-108 (1991) - 1989
- A. J. Petrenjuk:
On the constructive enumeration of packings and coverings of index one. Discret. Math. 77(1-3): 237-254 (1989)
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 2025-02-27 10:10 CET 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