Results 71 to 80 of about 222,622 (291)

Weakly-supervised Caricature Face Parsing through Domain Adaptation

open access: yes, 2019
A caricature is an artistic form of a person's picture in which certain striking characteristics are abstracted or exaggerated in order to create a humor or sarcasm effect.
Cai, Deng   +4 more
core   +1 more source

ProteoSeeker: A Feature‐Rich Metagenomic Analysis Tool for Accessible and Comprehensive Metagenomic Exploration

open access: yesAdvanced Science, EarlyView.
ProteoSeeker is a new metagenomic analysis tool that accelerates protein discovery. By automating key steps, it reduces computational complexity and enables comprehensive dataset analysis, performing protein identification, screening based on user‐defined protein families, and taxonomic analysis.
Georgios Filis   +6 more
wiley   +1 more source

Relative clauses as a benchmark for Minimalist parsing

open access: yesJournal of Language Modelling, 2017
Minimalist grammars have been used recently in a series of papers to explain well-known contrasts in human sentence processing in terms of subtle structural differences.
Thomas Graf, James Monette, Chong Zhang
doaj   +1 more source

How Important is Syntactic Parsing Accuracy? An Empirical Evaluation on Rule-Based Sentiment Analysis

open access: yes, 2017
Syntactic parsing, the process of obtaining the internal structure of sentences in natural languages, is a crucial task for artificial intelligence applications that need to extract meaning from natural language text or speech.
Alonso-Alonso, Iago   +2 more
core   +1 more source

Autonomous Self‐Evolving Research on Biomedical Data: The DREAM Paradigm

open access: yesAdvanced Science, EarlyView.
DREAM is a fully autonomous, self‐evolving biomedical research system capable of independently formulating scientific questions, performing analyses, and making new discoveries without human intervention. Validated in biomedical studies, DREAM significantly outperforms human scientists in research efficiency, accelerating scientific discovery and ...
Luojia Deng   +3 more
wiley   +1 more source

Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue

open access: yesAlgorithms, 2016
We briefly report on the national workshops on Formal Languages and Automata Theory as well as on Algorithms and Complexity Theory held in early Autumn, 2015.
Henning Fernau
doaj   +1 more source

Do All Fragments Count? [PDF]

open access: yesTechnical Report COMP-11-12, 2000
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that counts of almost arbitrary fragments within parse trees are important, leading to improved parse accuracy over previous models tested on this treebank.
arxiv  

Adaptive Temporal Encoding Network for Video Instance-level Human Parsing

open access: yes, 2018
Beyond the existing single-person and multiple-person human parsing tasks in static images, this paper makes the first attempt to investigate a more realistic video instance-level human parsing that simultaneously segments out each person instance and ...
Chen Liang-Chieh   +5 more
core   +1 more source

High‐Efficiency Optoelectronic Modulation in Quasi‐2D Perovskite‐Based Transistors for Neuromorphic Computing

open access: yesAdvanced Electronic Materials, EarlyView.
2‐thiophenemethylammonium (ThMA+) spacer cation‐based quasi‐2D (ThMA)2(MA)n‐1PbnI3n+1 (n = 4) photoelectric field‐effect transistors are developed, and its optoelectronic performance and neuromorphic computing are explored. Abstract Optoelectronic modulated transistors based on organic–inorganic halide perovskites can perceive and parse visual ...
Wenwen Wang   +6 more
wiley   +1 more source

Tabular Parsing [PDF]

open access: yesM.-J. Nederhof and G. Satta. Tabular Parsing. In C. Martin-Vide, V. Mitrana, and G. Paun, editors, Formal Languages and Applications, Studies in Fuzziness and Soft Computing 148, pages 529-549. Springer, 2004, 2004
This is a tutorial on tabular parsing, on the basis of tabulation of nondeterministic push-down automata. Discussed are Earley's algorithm, the Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse trees, and further issues.
arxiv  

Home - About - Disclaimer - Privacy