中文
相关论文

相关论文: On Ultrametric Algorithmic Information

200 篇论文

Visual object counting is a fundamental computer vision task underpinning numerous real-world applications, from cell counting in biomedicine to traffic and wildlife monitoring. However, existing methods struggle to handle the challenge of…

计算机视觉与模式识别 · 计算机科学 2025-07-31 Corentin Dumery , Noa Etté , Aoxiang Fan , Ren Li , Jingyi Xu , Hieu Le , Pascal Fua

In former work, we showed that a quantum algorithm requires the number of operations (oracle's queries) of a classical algorithm that knows in advance 50% of the information that specifies the solution of the problem. We gave a preliminary…

量子物理 · 物理学 2010-04-07 Giuseppe Castagnoli

If a robot is supposed to roam an environment and interact with objects, it is often necessary to know all possible objects in advance, so that a database with models of all objects can be generated for visual identification. However, this…

人工智能 · 计算机科学 2015-10-05 Laura Steinert , Jens Hoefinghoff , Josef Pauli

The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different…

计算复杂性 · 计算机科学 2013-06-11 Nadia Creignou , Arne Meier , Julian-Steffen Müller , Johannes Schmidt , Heribert Vollmer

Capturing the interesting components of an image is a key aspect of image understanding. When a speaker annotates an image, selecting labels that are informative greatly depends on the prior knowledge of a prospective listener. Motivated by…

计算机视觉与模式识别 · 计算机科学 2018-12-27 Lior Bracha , Gal Chechik

Complexity remains one of the central challenges in science and technology. Although several approaches at defining and/or quantifying complexity have been proposed, at some point each of them seems to run into intrinsic limitations or…

其他计算机科学 · 计算机科学 2021-10-05 Luciano da F. Costa , Guilherme S. Domingues

Algorithmic information theory translates statements about classes of objects into statements about individual objects; it defines individual random sequences, effective Hausdorff dimension of individual points, amount of information in…

信息论 · 计算机科学 2021-11-02 Alexander Shen

Insightful interdisciplinary collaboration is essential to the principled governance of technology. When such efforts address the interaction between computation and society, they often focus on modeling, the process by which computer…

计算机与社会 · 计算机科学 2025-05-29 Samuel Judson , Joan Feigenbaum

Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere…

机器学习 · 计算机科学 2023-12-13 Eduard Eiben , Robert Ganian , Iyad Kanj , Sebastian Ordyniak , Stefan Szeider

Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes…

计算机科学中的逻辑 · 计算机科学 2010-08-24 Fionn Murtagh

Maximizing the precision in estimating parameters in a quantum system subject to instrumentation constraints is cast as a convex optimization problem. We account for prior knowledge about the parameter range by developing a worst-case and…

量子物理 · 物理学 2008-04-01 Robert L. Kosut

Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…

计算机视觉与模式识别 · 计算机科学 2022-06-22 Jinhwi Lee , Jungtaek Kim , Hyunsoo Chung , Jaesik Park , Minsu Cho

I discuss several aspects of information theory and its relationship to physics and neuroscience. The unifying thread of this somewhat chaotic essay is the concept of Kolmogorov or algorithmic complexity (Kolmogorov Complexity, for short).…

综合物理 · 物理学 2007-05-23 Giulio Ruffini

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

逻辑 · 数学 2021-08-25 Donghyun Lim , Martin Ziegler

We consider the optimization of an uncertain objective over continuous and multi-dimensional decision spaces in problems in which we are only provided with observational data. We propose a novel algorithmic framework that is tractable,…

机器学习 · 统计学 2018-10-30 Dimitris Bertsimas , Christopher McCord

The ultimate limits of computation are not just logical, but physical. We investigate the physical resources -- time, energy, entropy, and free energy -- required to perform computational work. We apply the resulting measures of physical…

量子物理 · 物理学 2025-06-23 Michele Reilly , Seth Lloyd

Graph-based representations of images have recently acquired an important role for classification purposes within the context of machine learning approaches. The underlying idea is to consider that relevant information of an image is…

机器学习 · 计算机科学 2011-06-07 Alejandro Chinea , Elka Korutcheva

The advent of modern technology, permitting the measurement of thousands of characteristics simultaneously, has given rise to floods of data characterized by many large or even huge datasets. This new paradigm presents extraordinary…

统计方法学 · 统计学 2019-02-14 A. M. Pires , J. A. Branco

We study the amount of information that is contained in "random pictures", by which we mean the sample sets of a Boolean model. To quantify the notion "amount of information", two closely connected questions are investigated: on the one…

概率论 · 数学 2020-02-07 Frank Aurzada , Mikhail Lifshits

The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this…

计算复杂性 · 计算机科学 2012-05-23 Yonatan Bilu , Amit Daniely , Nati Linial , Michael Saks