English
Related papers

Related papers: Let's reinvent subtraction

200 papers

In this study, we introduce a low cost method for generating descriptions from images containing novel objects. Generally, constructing a model, which can explain images with novel objects, is costly because of the following: (1) collecting…

Computer Vision and Pattern Recognition · Computer Science 2020-03-09 Mikihiro Tanaka , Tatsuya Harada

The ability to fuse sentences is highly attractive for summarization systems because it is an essential step to produce succinct abstracts. However, to date, summarizers can fail on fusing sentences. They tend to produce few summary…

Computation and Language · Computer Science 2020-10-09 Logan Lebanoff , Franck Dernoncourt , Doo Soon Kim , Lidan Wang , Walter Chang , Fei Liu

A method of prediction is presented to aid compression of sequences of complex-valued samples. The focus is on using prediction to reduce the average magnitude of residual values after prediction (not on the subsequent compression of the…

Signal Processing · Electrical Eng. & Systems 2019-05-01 Thomas Tetzlaff

In this paper, we propose a general approach for improving the efficiency of computing distribution functions. The idea is to truncate the domain of summation or integration.

Probability · Mathematics 2008-08-07 Xinjia Chen

Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…

Cryptography and Security · Computer Science 2024-11-27 Martin Mathew , Javier Noda

Music rearrangement involves reshuffling, deleting, and repeating sections of a music piece with the goal of producing a standalone version that has a different duration. It is a creative and time-consuming task commonly performed by an…

Sound · Computer Science 2023-05-15 Christos Plachouras , Marius Miron

Data generated in the fields of science, technology, business and in many other fields of research are increasing in an exponential rate. The way to extract knowledge from a huge set of data is a challenging task. This paper aims to propose…

Information Retrieval · Computer Science 2010-03-23 P. G. JansiRani , R. Bhaskaran

Clustering is a common technique for statistical data analysis, which is used in many fields, including machine learning, data mining, pattern recognition, image analysis and bioinformatics. Clustering is the process of grouping similar…

Data Structures and Algorithms · Computer Science 2012-05-08 T. Soni Madhulatha

We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the usual definitions of infinitary rewriting, neither need for ordinals nor for metric convergence. While the idea…

Logic in Computer Science · Computer Science 2014-04-11 Joerg Endrullis , Helle Hvid Hansen , Dimitri Hendriks , Andrew Polonsky , Alexandra Silva

Creating a new Ontology: a Modular Approach

Artificial Intelligence · Computer Science 2015-03-17 Julia Dmitrieva , Fons J. Verbeek

Terminology extraction, also known as term extraction, is a subtask of information extraction. The goal of terminology extraction is to extract relevant words or phrases from a given corpus automatically. This paper focuses on the…

Computation and Language · Computer Science 2021-01-25 Suman Dowlagar , Radhika Mamidi

Despite our familiarity with specific technologies, the origin of new technologies remains mysterious. Are new technologies made from scratch, or are they built up recursively from new combinations of existing technologies? To answer this,…

Physics and Society · Physics 2019-12-09 Thomas M. A. Fink , Ali Teimouri

A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…

Combinatorics · Mathematics 2025-01-07 Oliver Tan

Scientific expertise often requires recognizing subtle visual differences that remain challenging to articulate even for domain experts. We present a system that leverages generative models to automatically discover and visualize minimal…

Computer Vision and Pattern Recognition · Computer Science 2025-05-16 Mia Chiquier , Orr Avrech , Yossi Gandelsman , Berthy Feng , Katherine Bouman , Carl Vondrick

We implement a divide-and-concur iterative projection approach to context-free grammar inference. Unlike most state-of-the-art models of natural language processing, our method requires a relatively small number of discrete parameters,…

Computation and Language · Computer Science 2022-09-19 Sean Deyo , Veit Elser

This thesis investigates the generation of new concepts from combinations of existing concepts as a language evolves. We give a method for combining concepts, and will be investigating the utility of composite concepts in language evolution…

Artificial Intelligence · Computer Science 2016-01-26 Martha Lewis , Jonathan Lawry

We introduce a concept called a collective: an interface with a protocol for aggregating contributions and distributing returns. Through such a protocol, many members may participate in a mutual endeavor. We present a variety of real-world…

Category Theory · Mathematics 2022-01-31 Nelson Niu , David I. Spivak

Rewriting techniques based on reduction orderings generate "just enough" consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem proving, but for at least one approach to inductive…

Logic in Computer Science · Computer Science 2024-03-01 Márton Hajdu , Laura Kovács , Michael Rawson

Superpixel segmentation consists of partitioning images into regions composed of similar and connected pixels. Its methods have been widely used in many computer vision applications since it allows for reducing the workload, removing…

Computer Vision and Pattern Recognition · Computer Science 2024-10-01 I. B. Barcelos , F. de C. Belém , L. de M. João , Z. K. G. do Patrocínio , A. X. Falcão , S. J. F. Guimarães

A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive…

Artificial Intelligence · Computer Science 2009-03-04 Claude-Guy Quimper , Toby Walsh
‹ Prev 1 4 5 6 7 8 10 Next ›