14,991 results for Paper

arxiv.org/abs/2303.06567v1

A Monkey Swing Counting Algorithm Based on Object Detection

This paper focuses on proposing a deep learning-based monkey swing counting algorithm. Nowadays, there are very few papers on monkey detection, and even fewer papers on monkey swing counting. This research focuses on this gap and attempts to count th...

arxiv.org/abs/2409.09351v1

E1 TTS: Simple and Fast Non-Autoregressive TTS

This paper introduces Easy One-Step Text-to-Speech (E1 TTS), an efficient non-autoregressive zero-shot text-to-speech system based on denoising diffusion pretraining and distribution matching distillation. The training of E1 TTS is straightforward; i...

arxiv.org/abs/2111.12800v1

Tiny Pointers

This paper introduces a new data-structural object that we call the tiny pointer. In many applications, traditional $\log n $-bit pointers can be replaced with $o (\log n )$-bit tiny pointers at the cost of only a constant-factor time overhead. We de...

arxiv.org/abs/1009.0788v1

An Algorithm for Computing the Ratliff-Rush Closure

Let I\subset K[x,y] be a <x,y>-primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff-Rush closure I for the ideal I=<m_0,...,m_{n}> whenever m_{i} is contained in the integral closure of the ideal <x^{a...

arxiv.org/abs/1908.10185v1

Powers of monomial ideals and the Ratliff-Rush operation

Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper we present a nice presentation of high powers of ideals in a certain class in $\mathbb K[x_1, \ldots, x_n]$ and $\mathbb K[[x_1, \ldots, x_n]]$. As an...

arxiv.org/abs/2010.09657v1

PySBD: Pragmatic Sentence Boundary Disambiguation

In this paper, we present a rule-based sentence boundary disambiguation Python package that works out-of-the-box for 22 languages. We aim to provide a realistic segmenter which can provide logical sentences even when the format and domain of the inpu...

arxiv.org/abs/2405.01507v3

Accelerating Convergence in Bayesian Few-Shot Classification

Bayesian few-shot classification has been a focal point in the field of few-shot learning. This paper seamlessly integrates mirror descent-based variational inference into Gaussian process-based few-shot classification, addressing the challenge of no...

arxiv.org/abs/2403.19824v1

BRK-type sets over finite fields

A Besicovitch-Rado-Kinney (BRK) set in $\mathbb{R}^n$ is a Borel set that contains a $(n-1)$-dimensional sphere of radius $r$, for each $r>0$. It is known that such sets have Hausdorff dimension $n$ from the work of Kolasa and Wolff. In this paper, w...

arxiv.org/abs/2309.11671v1

Popularity Degradation Bias in Local Music Recommendation

In this paper, we study the effect of popularity degradation bias in the context of local music recommendations. Specifically, we examine how accurate two top-performing recommendation algorithms, Weight Relevance Matrix Factorization (WRMF) and Mult...

arxiv.org/abs/1006.3715v1

Should Static Search Trees Ever Be Unbalanced?

In this paper we study the question of whether or not a static search tree should ever be unbalanced. We present several methods to restructure an unbalanced k-ary search tree $T$ into a new tree $R$ that preserves many of the properties of $T$ while...

arxiv.org/abs/0804.3275v1

The relevance of neck linker docking in the motility of kinesin

Conventional kinesin is a motor protein, which is able to walk along a microtubule processively. The exact mechanism of the stepping motion and force generation of kinesin is still far from clear. In this paper we argue that neck linker docking is...

github.com/zhegan27/VILLA

zhegan27/VILLA

Research Code for NeurIPS 2020 Spotlight paper "Large-Scale Adversarial Training for Vision-and-Language Representation Learning": UNITER adversarial training part (⭐ 119)

arxiv.org/abs/0708.1512v1

Solving the Hamiltonian path problem with a light-based computer

In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by t...

www.bing.com/ck/a?!&&p=567300dc02dacff4bc97d3f7c0db6492bada4042038898acc4e67a280b1357faJmltdHM9MTc3Mjg0MTYwMA&ptn=3&ver=2&hsh=4&fclid=12d293b0-9d9a-6784-1726-84a59cc96647&u=a1aHR0cHM6Ly9saW5rLnNwcmluZ2VyLmNvbS9qb3VybmFsLzYwNw&ntb=1

Home | Computing | Springer Nature Link

Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential …

arxiv.org/abs/2409.19166v1

Understanding #vent Channels on Discord

Vent channels on Discord, which are chat channels developed for people to express frustrations, can become an informal type of peer support system. This paper is a qualitative study of experiences with vent channels on Discord, examining the experien...