Results 171 to 180 of about 299,432 (335)
IN PURSUIT OF THE HOFFMANNESQUE
German Life and Letters, EarlyView.ABSTRACT This article seeks to elucidate the term ‘Hoffmannesque’ — the eponymous adjective that refers to E. T. A. Hoffmann — through recourse to Hoffmann's own use of ‘esque’ words: arabesque, grotesque, burlesque, picturesque. By investigating the characteristics of ‘esque’ formulations and tracing their recurrence through Hoffmann's texts, I argue ...
Polly Dickson
wiley +1 more source
OjibweMorph: an approachable finite-state transducer for Ojibwe (and beyond). [PDF]
Lang Resour EvalHammerly C +4 more
europepmc +1 more source
International Journal of Systematic Theology, EarlyView.Abstract Dionysius's vision of eros as a meeting of reciprocal ecstasies – where lover and beloved each pass out of themselves and into the other – has often been read as unifying dimensions of love otherwise thought to stand in tension, such as giving and receiving.
Noah Karger
wiley +1 more source
Simpler predictive models provide higher accuracy for ovarian cancer detection. [PDF]
PeerJWood DE, Roy J, Ballew BJ.
europepmc +1 more source
Genres of Paradoxical IS Theorising: Of Chaos–Puzzles and Spear–Shields
Information Systems Journal, EarlyView.ABSTRACT Paradox is a powerful lens for theorising information systems (IS) phenomena. However, as scholars apply the term to fundamentally different phenomena, ‘paradox’ risks dilution. Much confusion stems from conflating two concepts under the same English label ‘paradox’: chaos–puzzles (seemingly impossible ideas, aligned with the Chinese term ‘bei
Blair Wang +2 more
wiley +1 more source
Efficient near-telomere-to-telomere assembly of nanopore simplex reads. [PDF]
NatureCheng H +7 more
europepmc +1 more source
Beyond Prefix-Based Interactive Translation Prediction [PDF]
, 2016 Jesús González-Rubio +3 more
openalex +1 more source
Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems
International Transactions in Operational Research, EarlyView.Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos +3 more
wiley +1 more source