14,991 results for Paper

arxiv.org/abs/2201.05939v1

Algorithmic Authority: The Case of Bitcoin

In this paper, I propose a new concept for understanding the role of algorithms in daily life: algorithmic authority. Algorithmic authority is the legitimate power of algorithms to direct human action and to impact which information is considered tru...

arxiv.org/abs/2407.01505v1

Self-Cognition in Large Language Models: An Exploratory Study

While Large Language Models (LLMs) have achieved remarkable success across various applications, they also raise concerns regarding self-cognition. In this paper, we perform a pioneering study to explore self-cognition in LLMs. Specifically, we first...

arxiv.org/abs/2501.05032v2

Enhancing Human-Like Responses in Large Language Models

This paper explores the advancements in making large language models (LLMs) more human-like. We focus on techniques that enhance natural language understanding, conversational coherence, and emotional intelligence in AI systems. The study evaluates v...

arxiv.org/abs/1211.1813v3

Pro cdh-descent for cyclic homology and $K$-theory

In this paper we prove that cyclic homology, topological cyclic homology, and algebraic $K$-theory satisfy a pro Mayer--Vietoris property with respect to abstract blow-up squares of varieties, in both zero and finite characteristic. This may be inter...

arxiv.org/abs/1905.08841v4

Parallel Reachability in Almost Linear Work and Square Root Depth

In this paper we provide a parallel algorithm that given any $n$-node $m$-edge directed graph and source vertex $s$ computes all vertices reachable from $s$ with $\tilde{O}(m)$ work and $n^{1/2 + o(1)}$ depth with high probability in $n$ . This algor...

arxiv.org/abs/1811.08719v1

A Simple Proof for the Cycle Double Cover Conjecture

Given a bridgeless graph G, the well-known cycle double cover conjecture posits that there is a list of cycles of G, such that every edge appears in exactly two cycles. In this paper, we prove the cycle double cover conjecture. More precisely, we pro...

arxiv.org/abs/1606.07639v3

Mixing times of random walks on dynamic configuration models

The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random graph become...

arxiv.org/abs/2204.03967v1

The Sillwood Technologies System for the VoiceMOS Challenge 2022

In this paper we describe our entry for the VoiceMOS Challenge 2022 for both the main and out-of-domain (OOD) track of the competition. Our system is based on finetuning pre-trained self-supervised waveform prediction models, while improving its gene...

arxiv.org/abs/2206.15138v2

DFGC 2022: The Second DeepFake Game Competition

This paper presents the summary report on our DFGC 2022 competition. The DeepFake is rapidly evolving, and realistic face-swaps are becoming more deceptive and difficult to detect. On the contrary, methods for detecting DeepFakes are also improving....

arxiv.org/abs/0904.3552v1

Internet: Romania vs. Europe

This paper presents various access ways to Internet for home users, both for those who are low consumers (consumed time online or traffic monthly value), or large consumers (unlimited connection). The main purpose of the work consists in making a c...