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 77 matches
- 2024
- Hao Xie, Dong Li:
How Much Time Is Required for Phase Shift Delivery in RIS-Aided Wireless Systems? IEEE Wirel. Commun. Lett. 13(3): 819-823 (2024) - 2023
- Noelia Rico, Camino R. Vela, Irene Díaz:
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner. Eur. J. Oper. Res. 305(3): 1323-1336 (2023) - Christine Ida Hucke, Rebekka Margret Heinen, Edmund Wascher, Christoph van Thriel:
Trigeminal stimulation is required for neural representations of bimodal odor localization: A time-resolved multivariate EEG and fNIRS study. NeuroImage 269: 119903 (2023) - Matej Plugel, Domagoj Tolic:
Neural Networks to Predict Software Development/Maintenance Performance and Required Time. SoftCOM 2023: 1-6 - Hao Xie, Dong Li:
How Much Time is Required for Phase Shift Delivery in RIS-Aided Wireless Systems? CoRR abs/2311.10295 (2023) - 2021
- Kendall J. Kiser, Arko Barman, Sonja Stieb, Clifton D. Fuller, Luca Giancardo:
Novel Autosegmentation Spatial Similarity Metrics Capture the Time Required to Correct Segmentations Better Than Traditional Metrics in a Thoracic Cavity Segmentation Workflow. J. Digit. Imaging 34(3): 541-553 (2021) - Matthias Skuballa, Andreas Walz, Heiko Bühler, Axel Sikora:
Cryptographic Protection of Cyclic Real-Time Communication in Ethernet-Based Fieldbuses: How Much Hardware is Required? ETFA 2021: 1-7 - Tatiana M. Tatarnikova, Boris Ya. Sovetov, Vladislav V. Cehanovsky:
Determining the Length of the Time Series Sequence for Generating Self-Similar Traffic with the Required Hurst Index. MECO 2021: 1-4 - 2020
- Vasco Ponciano, Ivan Miguel Pires, Fernando Reinaldo Ribeiro, María Vanessa Villasana, Maria Cristina Canavarro Teixeira, Eftim Zdravevski:
Experimental Study for Determining the Parameters Required for Detecting ECG and EEG Related Diseases during the Timed-Up and Go Test. Comput. 9(3): 67 (2020) - Shinya Iwasaki, Xuying Lei, Kazuhiro Chida, Yasuko Sugito, Kazuhisa Iguchi, Kikufumi Kanda, Hidenobu Miyoshi, Yoshifumi Uehara:
The Required Video Bitrate for 8K120-HZ Real-time Temporal Scalable Coding. ICCE 2020: 1-5 - Gordon Gibb, Rupert Nash, Nick Brown, Bianca Prodan:
The Technologies Required for Fusing HPC and Real-Time Data to Support Urgent Computing. CoRR abs/2010.01543 (2020) - 2019
- Lili Lu, Xuan Li, Pengjun Zheng, Kaihao Wang:
Determining the Required Probe Vehicle Size for Real-Time Travel Time Estimation on Signalized Arterial. IEEE Access 7: 4546-4554 (2019) - Raja Muthalagu, Subeen Jain:
Reducing the time required by KASUMI to generate output by modifying the FL and FI functions. Iran J. Comput. Sci. 2(1): 33-40 (2019) - Vladi Kolici, Yi Liu, Leonard Barolli:
A Fuzzy-Based Peer Coordination Quality System in Mobile P2P Networks: Effect of Time for Finishing Required Task (TFRT) Parameter. 3PGCIC 2019: 3-13 - Gordon Gibb, Rupert Nash, Nick Brown, Bianca Prodan:
The Technologies Required for Fusing HPC and Real-Time Data to Support Urgent Computing. UrgentHPC@SC 2019: 24-34 - 2018
- Ralf Borndörfer, Marika Karbstein, Christian Liebchen, Niels Lindner:
A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable. ATMOS 2018: 16:1-16:15 - Frank van Outvorst, Mart Meijnen, Pascal Timens, Sjoerd Walenberg, Benny De Waal:
Determining the Required Capacity of Business Information Management: Towards a Concise Instrument. Bled eConference 2018: 5 - Shin Kamada, Takumi Ichimura:
Shortening Time Required for Adaptive Structural Learning Method of Deep Belief Network with Multi-Modal Data Arrangement. CoRR abs/1807.03952 (2018) - 2017
- Shin Kamada, Takumi Ichimura:
Shortening time required for adaptive structural learning method of deep belief network with multi-modal data arrangement. IWCIA 2017: 97-102 - Stephen J. Cohen, William H. Money:
Data Systems Fault Coping for Real-time Big Data Analytics Required Architectural Crucibles. HICSS 2017: 1-10 - Katja Lehmann, Matthias Söllner, Ivo Blohm, Jan Marco Leimeister:
Third Time is a Charm - Determining the Required Number of Assessors when Using Peer Assessment in Large-Scale Lectures. ICIS 2017 - 2016
- Kurt VanLehn, Gregory K. W. K. Chung, Sachin Grover, Ayesha Madni, Jon Wetzel:
Learning Science by Constructing Models: Can Dragoon Increase Learning without Increasing the Time Required? Int. J. Artif. Intell. Educ. 26(4): 1033-1068 (2016) - Javier García-Heras Carretero, Manuel Soler, Francisco Javier Sáez Nieto:
Collocation Methods to Minimum-Fuel Trajectory Problems with Required Time of Arrival in ATM. J. Aerosp. Inf. Syst. 13(7): 243-265 (2016) - Kathleen E. Fenerty, Nicholas J. Patronas, Christopher R. Heery, James L. Gulley, Les R. Folio:
Resources Required for Semi-Automatic Volumetric Measurements in Metastatic Chordoma: Is Potentially Improved Tumor Burden Assessment Worth the Time Burden? J. Digit. Imaging 29(3): 357-364 (2016) - Junichi Funasaka, Kazuya Takeda:
Evaluation on Required Time and Arrival Order of Blocks for Segmented File Downloading Methods Using PR-SCTP and Unordered Delivery. ICDCS Workshops 2016: 140-145 - Björn B. Brandenburg, Mahircan Gul:
Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations. RTSS 2016: 99-110 - 2015
- Klaus Altendorfer, Stefan Minner:
Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times. Eur. J. Oper. Res. 243(2): 555-565 (2015) - Makoto Fukumoto, Makoto Inoue, Shimpei Koga, Jun-ichi Imai:
Interactive differential evolution using time information required for user's selection: In a case of optimizing fragrance composition. CEC 2015: 2192-2198 - 2014
- Heungjae Cho, Jaeil Park:
Motion-based method for estimating time required to attach self-adhesive insulators. Comput. Aided Des. 56: 68-87 (2014) - Hamed Aminzadeh, Marzieh Banihashemi:
Miller Compensation: Optimal Design for Operational Amplifiers with a Required Settling Time. Circuits Syst. Signal Process. 33(9): 2675-2694 (2014)
skipping 47 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-09-25 12:31 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