Results 71 to 80 of about 445,078 (279)

Push the Limits: Human‐Like Multimodal Extreme Embodied Intelligence for Autonomous Racing

open access: yesAdvanced Robotics Research, EarlyView.
Autonomous racing tests embodied intelligence under extreme control limits of speed, actuation, and decision‐making. Inspired by human multimodality, we present Apex, an embodied agent deployed on a super‐formula racing car at Yas Marina. Integrating physics‐informed perception, multimodal learning, and tasking, Apex cuts lap times by 15% and achieves ...
Yanxin Zhou   +13 more
wiley   +1 more source

Charting Endocrine Progenitors Across Species and Organs

open access: yesAdvanced Science, EarlyView.
Endocrine progenitors give rise to the hormone‐producing cells of the pancreas and intestine. Using single‐cell multiomics and proteomics, this study compares these progenitors across species, systems, and organs, mapping the conserved and species‐specific gene regulatory networks that guide their formation.
Changying Jing   +21 more
wiley   +1 more source

The Effect of Non-tightness on Bayesian Estimation of PCFGs [PDF]

open access: yes, 2013
Probabilistic context-free grammars have the unusual property of not always defining tight distributions (i.e., the sum of the ``probabilities'' of the trees the grammar generates can be less than one). This paper reviews how this non-tightness can arise
Johnson, M., Cohen, S. B.
core  

Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics

open access: yesAdvanced Science, EarlyView.
Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Dongyu Bai   +3 more
wiley   +1 more source

Probabilistic hyperedge replacement grammars

open access: yesTheoretical Computer Science, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Automating Chemical Reasoning in High‐Throughput Phase Identification With a Probabilistic, LLM‐Guided Framework

open access: yesAdvanced Science, EarlyView.
Autonomous laboratories can now synthesize materials faster than experts can interpret the resulting diffraction data. A probabilistic framework combines refinement‐fit metrics with large language model‐derived chemical reasoning to rank competing phase interpretations and flag those unsuitable for autonomous use.
Olympia Dartsi   +7 more
wiley   +1 more source

Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations [PDF]

open access: yes, 2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional Grammar (LFG) resources acquired from treebanks.
O'Donovan, Ruth   +4 more
core   +3 more sources

Accounting for the stochastic nature of sound symbolism using Maximum Entropy model

open access: yesOpen Linguistics, 2019
Sound symbolism refers to stochastic and systematic associations between sounds and meanings. Sound symbolism has not received much serious attention in the generative phonology literature, perhaps because most if not all sound symbolic patterns are ...
Kawahara Shigeto   +2 more
doaj   +1 more source

CoSpa: A Co-training Approach for Spam Review Identification with Support Vector Machine

open access: yesInformation, 2016
Spam reviews are increasingly appearing on the Internet to promote sales or defame competitors by misleading consumers with deceptive opinions. This paper proposes a co-training approach called CoSpa (Co-training for Spam review identification) to ...
Wen Zhang   +3 more
doaj   +1 more source

A Probabilistic Generative Grammar for Semantic Parsing

open access: yesCoRR, 2016
Domain-general semantic parsing is a long-standing goal in natural language processing, where the semantic parser is capable of robustly parsing sentences from domains outside of which it was trained. Current approaches largely rely on additional supervision from new domains in order to generalize to those domains.
Abulhair Saparov, Tom M. Mitchell
openaire   +3 more sources

Home - About - Disclaimer - Privacy