Expertini Research Research

Browse Research Papers

7+ open-access research outputs.

โœ• Clear
๐Ÿ” hartmut spliethoff ๐Ÿ“‚ Computer Science
Showing 7 results for "hartmut spliethoff" in Computer Science
Computer Science Preprint PDF DOI

Interpretive Cultures: Resonance, randomness, and negotiated meaning for AI-assisted tarot divination

Matthew Prock, Ziv Epstein, Hope Schroeder, Amy Smith, Cassandra Lee, Vana Goblot, Farnaz Jahanbakhsh ยท 2026

While generative AI tools are increasingly adopted for creative and analytical tasks, their role in interpretive practices, where meaning is subjective, plural, and non-causal, remains poorly understoโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Dynamic Realization Games in Newsvendor Inventory Centralization

M. Dror, Luis A. Guardiola, Ana Meca, Justo Puerto ยท 2024

Consider a set N of n (>1) stores with single-item and single-period nondeterministic demands like in a classic newsvendor setting with holding and penalty costs only. Assume a risk-pooling single-warโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A barrier for further approximating Sorting By Transpositions

Luiz Augusto G. da Silva, Luis Antonio B. Kowada, Maria Emilia M. T. Walter ยท 2023

The Transposition Distance Problem (TDP) is a classical problem in genome rearrangements which seeks to determine the minimum number of transpositions needed to transform a linear chromosome into anotโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A new 1.375-approximation algorithm for Sorting By Transpositions

L. A. G. Silva, L. A. B. Kowada, N. R. Rocco, M. E. M. T. Walter ยท 2020

In genome rearrangements, the mutational event transposition swaps two adjacent blocks of genes in one chromosome. The Transposition Distance Problem (TDP) aims to find the minimum number of transposiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters

Ivan Bliznets, Nikolai Karpov ยท 2017

Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally defined as cliques. โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Partout: A Distributed Engine for Efficient RDF Processing

Luis Galarraga, Katja Hose, Ralf Schenkel ยท 2012

The increasing interest in Semantic Web technologies has led not only to a rapid growth of semantic data on the Web but also to an increasing number of backend applications with already more than a trโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in $O(n\log n)$ Time

Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman ยท 2009

Sorting a Permutation by Transpositions (SPbT) is an important problem in Bioinformtics. In this paper, we improve the running time of the best known approximation algorithm for SPbT. We use the permuโ€ฆ

Read Paper โ†’