Остановите войну!
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 23 matches
- 2022
- Merab Gomez, Dalton Klare, Natalie Ceballos, Stephanie Dailey, Sierra Kaiser, Krista Howard:
Do You Dare to Compare?: The Key Characteristics of Social Media Users Who Frequently Make Online Upward Social Comparisons. Int. J. Hum. Comput. Interact. 38(10): 938-948 (2022) - Fabian Hölzke, Frank Golatowski, Dirk Timmermann:
Stride Reconstruction Through Frequent Location Updates and Step Detection. MetroInd4.0& IoT 2022: 212-217 - 2020
- Jerry Lonlac, Arnaud Doniec, Marin Lujak, Stéphane Lecoeuche:
Mining Frequent Seasonal Gradual Patterns. DaWaK 2020: 197-207 - 2019
- Yiming Wang, Yun Li, Haihua Shen, Dongyu Fan, Wei Wang, Ling Li, Qi Liu, Feng Zhang, Xinghua Wang, Meng-Fan Chang, Ming Liu:
A Few-Step and Low-Cost Memristor Logic Based on MIG Logic for Frequent-Off Instant-On Circuits in IoT Applications. IEEE Trans. Circuits Syst. II Express Briefs 66-II(4): 662-666 (2019) - 2018
- Kristin Stephens-Martinez, Armando Fox:
Giving hints is complicated: understanding the challenges of an automated hint system based on frequent wrong answers. ITiCSE 2018: 45-50 - 2017
- Idan Alter, Loren Gragert, Stephanie Fingerson, Martin Maiers, Yoram Louzoun:
HLA class I haplotype diversity is consistent with selection for frequent existing haplotypes. PLoS Comput. Biol. 13(8) (2017) - Ziad S. Haddad, Ousmane O. Sy, Svetla M. Hristova-Veleva, Graeme L. Stephens:
Derived Observations From Frequently Sampled Microwave Measurements of Precipitation - Part I: Relations to Atmospheric Thermodynamics. IEEE Trans. Geosci. Remote. Sens. 55(6): 3441-3453 (2017) - Ousmane O. Sy, Ziad S. Haddad, Graeme L. Stephens, Svetla M. Hristova-Veleva:
Derived Observations From Frequently Sampled Microwave Measurements of Precipitation. Part II: Sensitivity to Atmospheric Variables and Instrument Parameters. IEEE Trans. Geosci. Remote. Sens. 55(5): 2898-2912 (2017) - Kristin Stephens-Martinez, An Ju, Krishna Parashar, Regina Ongowarsito, Nikunj Jain, Sreesha Venkat, Armando Fox:
Taking Advantage of Scale by Analyzing Frequent Constructed-Response, Code Tracing Wrong Answers. ICER 2017: 56-64 - 2014
- Daniël Reijsbergen, Stephen Gilmore:
Formal Punctuality Analysis of Frequent Bus Services Using Headway Data. EPEW 2014: 164-178 - Shannon M. Bell, Stephen W. Edwards:
Building associations between markers of environmental stressors and adverse human health impacts using frequent itemset mining. SDM 2014: 551-559 - 2012
- Matthias Niemann, Danilo Schmidt, Gabriela Lindemann von Trzebiatowski, Carl Hinrichs:
First Steps towards a Frequent Pattern Mining with Nephrology Data in the Medical Domain. CS&P 2012: 261-268 - 2011
- Stéphane Gosselin:
Recherche de motifs fréquents dans une base de cartes combinatoires. (Frequent pattern discovery in combinatorial maps databases). Claude Bernard University Lyon 1, France, 2011 - Stéphane Gosselin, Guillaume Damiand, Christine Solnon:
Frequent Submap Discovery. CPM 2011: 429-440 - 2009
- Stéphanie Jacquemont, François Jacquenet, Marc Sebban:
A lower bound on the sample size needed to perform a significant frequent pattern mining task. Pattern Recognit. Lett. 30(11): 960-967 (2009) - 2008
- Ruili Wang, Luofeng Xu, Stephen Marsland, Ramesh Kumar Rayudu:
An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases. Int. J. Intell. Syst. Technol. Appl. 4(3/4): 313-326 (2008) - 2007
- Ling Zhou, Stephen S.-T. Yau:
Efficient association rule mining among both frequent and infrequent items. Comput. Math. Appl. 54(6): 737-749 (2007) - 2005
- Stephen E. Chick, Yaozhong Wu:
Selection Procedures with Frequentist Expected Opportunity Cost Bounds. Oper. Res. 53(5): 867-878 (2005) - Alain Casali, Rosine Cicchetti, Lotfi Lakhal, Stéphane Lopes:
Couvertures parfaites des motifs fréquents. Ingénierie des Systèmes d Inf. 10(2): 117-138 (2005) - 2003
- Stéphane Aris-Brosou:
How Bayes tests of molecular phylogenies compare with frequentist approaches. Bioinform. 19(5): 618-624 (2003) - 2001
- Alan P. Sprague, Stephen E. Brossette:
Medical Surveillance, Frequent Sets, and Closure Operations. J. Comb. Optim. 5(1): 81-94 (2001) - 1999
- Stephen E. Brossette, Alan P. Sprague:
Frequent sets in the presence of clones: An example from medical surveillance. Discrete Mathematical Problems with Medical Applications 1999: 165-169 - 1998
- Koichiro Inoue, Stephen E. Chick:
Comparison of Bayesian and Frequentist Assessments of Uncertainty for Selecting the Best System. WSC 1998: 727-734
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-23 12:05 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