Results 211 to 220 of about 122,919 (287)
Some of the next articles are maybe not open access.
Complex Left Branches, Spellout, and Prefixes
Oxford Scholarship Online, 2018Higher-function words such as complementizers, negation, functional prepositions, definiteness particles, comparative markers, and so forth, occurring to the left of their lexical category, are argued to be base-generated as complex left branches, rather
M. Starke
semanticscholar +1 more source
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\).
Richard E. Ladner, Michael J. Fischer
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\).
Richard E. Ladner, Michael J. Fischer
openaire +1 more source
Hydragen: High-Throughput LLM Inference with Shared Prefixes
arXiv.orgTransformer-based large language models (LLMs) are now deployed to hundreds of millions of users. LLM inference is commonly performed on batches of sequences that share a prefix, such as few-shot examples or a chatbot system prompt.
Jordan Juravsky +5 more
semanticscholar +1 more source
Traffic Monitoring and Analysis, 2019
Geo-locating BGP prefixes can help us understand routing anomalies, prefix aggregation, or reveal what regions are affected by an Internet outage.
Philipp Winter +3 more
semanticscholar +1 more source
Geo-locating BGP prefixes can help us understand routing anomalies, prefix aggregation, or reveal what regions are affected by an Internet outage.
Philipp Winter +3 more
semanticscholar +1 more source
Predictive Monitoring with Strong Trace Prefixes
International Conference on Computer Aided VerificationRuntime predictive analyses enhance coverage of traditional dynamic analyses based bug detection techniques by identifying a space of feasible reorderings of the observed execution and determining if any of these witnesses the violation of some desired ...
Z. Ang, Umang Mathur
semanticscholar +1 more source
Computational Geometry, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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.
openaire +2 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.
openaire +2 more sources
Oneida prepronominal prefixes in Information-based Morphology
Morphology, 2019Thomas S. Diaz +2 more
semanticscholar +1 more source