Results 231 to 240 of about 287,181 (286)
Efficient IPv6 address scanning based on hostname correlation in IPv6-only network. [PDF]
Sci RepSun C +6 more
europepmc +1 more source
Conditional generative adversarial network technology for OFDM system receiver signal detection. [PDF]
PLoS OneLiu Y, Liu P, Shi Y, Hao X.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM SIGMETRICS Performance Evaluation Review, 2018
In modern datacenter networks (DCNs), failures of network devices are the norm rather than the exception, and many research efforts have focused on dealing with failures after they happen. In this paper, we take a different approach by predicting failures, thus the operators can intervene and "fix" the potential failures before they happen ...
Shenglin Zhang +13 more
openaire +1 more source
In modern datacenter networks (DCNs), failures of network devices are the norm rather than the exception, and many research efforts have focused on dealing with failures after they happen. In this paper, we take a different approach by predicting failures, thus the operators can intervene and "fix" the potential failures before they happen ...
Shenglin Zhang +13 more
openaire +1 more source
2023
AbstractWe consider fragments of first-order logic (with and without equality) defined by means of standard quantifier prefix specifiers, over signatures containing no function symbols. We determine, in each case, the decidability and complexity of the (finite) satisfiability problem. Two of these results tower above the others.
+4 more sources
AbstractWe consider fragments of first-order logic (with and without equality) defined by means of standard quantifier prefix specifiers, over signatures containing no function symbols. We determine, in each case, the decidability and complexity of the (finite) satisfiability problem. Two of these results tower above the others.
+4 more sources
2021
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Broda, Sabine +3 more
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 26, Numbers 1-2, 2021, 17 ...
Broda, Sabine +3 more
openaire +2 more sources
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
2002
Abstract In the preceding chapters, the word-forming properties of head movement and phrasal movement have been the topic of discussion. What these movement operations have in common is that as a rule they give rise to suffixes. More precisely, if head movement or phrasal movement creates a complex word out of a lexical element and one ...
openaire +2 more sources
Abstract In the preceding chapters, the word-forming properties of head movement and phrasal movement have been the topic of discussion. What these movement operations have in common is that as a rule they give rise to suffixes. More precisely, if head movement or phrasal movement creates a complex word out of a lexical element and one ...
openaire +2 more sources
Proceedings of the tenth international conference on Information and knowledge management - CIKM'01, 2001
This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In our earlier work, we suggested an efficient method for whole matching under time warping.
Sanghyun Park +3 more
openaire +1 more source
This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In our earlier work, we suggested an efficient method for whole matching under time warping.
Sanghyun Park +3 more
openaire +1 more source