Results 71 to 80 of about 679,088 (213)

Jumala jälgi ajamas [PDF]

open access: yesMäetagused, 2014
The paper discusses the origins of the Estonian word jumal (‘God’). First, it summarises the versions proposed by previous treatises, and thereafter the linguistic material of Estonian runo songs is analysed in order to detect variations in its usage ...
Ene Vainik
doaj   +1 more source

‘We Do Not Forget, We Do Not Forgive’: Anti‐Feminicide Collages and the Commemorative Politics of Care in Urban Space

open access: yesTijdschrift voor Economische en Sociale Geografie, EarlyView.
Abstract This paper explores the commemorative practices of two feminist collectives engaging in anti‐feminicide collages in the cities of Paris and Montreuil. Based on ethnographic fieldwork conducted between 2023 and 2025, it examines how these activist interventions, as temporary urban memorials, intersect memory‐work and care‐work in urban space ...
Morgane Rudaz
wiley   +1 more source

Enhancing Generalized Compressed Suffix Trees, with Applications [PDF]

open access: yes
Generalized suffix trees are data structures for storing and searching a set of strings. Though many string problems can be solved efficiently using them, their space usage can be large relative to the size of the input strings. For a set of strings with
Chakraborty, Sankardeep   +2 more
core   +1 more source

Suffix trees and suffix arrays in primary and secondary storage [PDF]

open access: yes, 2007
In recent years the volume of string data has increased exponentially, and the speed at which these data is being generated has also increased. Some examples of string data includes biological sequences, internet webpages, and digitalized documents, to ...
Ko, Pang
core   +1 more source

On Correlation Polynomials and Subword Complexity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj   +1 more source

Infinite Ends From Finite Samples: Open‐Ended Goal Inference as Top‐Down Bayesian Filtering of Bottom‐Up Proposals

open access: yesTopics in Cognitive Science, EarlyView.
Abstract The space of human goals is tremendously vast; and yet, from just a few moments of watching a scene or reading a story, we seem to spontaneously infer a range of plausible motivations for the people and characters involved. What explains this remarkable capacity for intuiting other agents' goals, despite the infinitude of ends they might ...
Tan Zhi‐Xuan   +3 more
wiley   +1 more source

Unsupervised Anomaly Detection System for nIDS-s based on payload and Probabilistic Suffix Trees [PDF]

open access: yes, 2009
Due to the popularity of computer networks, detection of network attacks is a critical aspect of the security of the companies. As a consequence, any complete security package includes a network Intrusion Detection System (nIDS).
Martín Aramburu, José Ignacio   +5 more
core   +1 more source

Whole-Genome Alignment: Methods, Challenges, and Future Directions

open access: yesApplied Sciences
Whole-genome alignment (WGA) is a critical process in comparative genomics, facilitating the detection of genetic variants and aiding our understanding of evolution. This paper offers a detailed overview and categorization of WGA techniques, encompassing
Bacem Saada   +4 more
doaj   +1 more source

Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.
ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada   +2 more
wiley   +1 more source

Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis

open access: yesAlgorithms for Molecular Biology, 2012
Background Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical ...
Vinga Susana   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy