English
Related papers

Related papers: Cantor Mapping Technique

200 papers

Polynomial regression is widely used and can help to express nonlinear patterns. However, considering very high polynomial orders may lead to overfitting and poor extrapolation ability for unseen data. The paper presents a method for…

Machine Learning · Computer Science 2023-08-01 Andrei Ivanov , Stefan Maria Ailuro

This work presents a comparison of machine learning algorithms that are implemented to segment the characters of text presented as an image. The algorithms are designed to work on degraded documents with text that is not aligned in an…

Computer Vision and Pattern Recognition · Computer Science 2021-07-29 P Preethi , Hrishikesh Viswanath

Comparing document semantics is one of the toughest tasks in both Natural Language Processing and Information Retrieval. To date, on one hand, the tools for this task are still rare. On the other hand, most relevant methods are devised from…

Computation and Language · Computer Science 2020-12-09 Yuqi Kong , Fanchao Meng , Benjamin Carterette

Vector representations of natural language are ubiquitous in search applications. Recently, various methods based on contrastive learning have been proposed to learn textual representations from unlabelled data; by maximizing alignment…

Computation and Language · Computer Science 2023-07-17 Sachin J. Chanchani , Ruihong Huang

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

To minimize data movement, state-of-the-art parallel sorting algorithms use techniques based on sampling and histogramming to partition keys prior to redistribution. Sampling enables partitioning to be done using a representative subset of…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Vipul Harsh , Laxmikant Kale , Edgar Solomonik

Universal representation of geometric patterns of disordered matters is investigated with the aid of general topology. By utilizing the result obtained in the previous study (S. Ohmori, et.al., Phys. Scr. 94, 105213 (2019)) that any…

Mathematical Physics · Physics 2023-06-21 Shousuke Ohmori , Yoshihiro Yamazaki , Tomoyuki Yamamoto , Akihiko Kitada

String matching is a fundamental problem in computer science, with critical applications in text retrieval, bioinformatics, and data analysis. Among the numerous solutions that have emerged for this problem in recent decades,…

Data Structures and Algorithms · Computer Science 2025-03-10 Simone Faro , Arianna Pavone , Caterina Viola

Packing optimization is a prevalent problem that necessitates robust and efficient algorithms that are also simple to implement. One group of approaches is the raster methods, which rely on approximating the objects with pixelated…

Computational Geometry · Computer Science 2020-12-10 Gokhan Serhat

Sonar systems are frequently used to classify objects at a distance by using the structure of the echoes of acoustic waves as a proxy for the object's shape and composition. Traditional synthetic aperture processing is highly effective in…

Computational Engineering, Finance, and Science · Computer Science 2021-12-14 Michael Robinson

Various decision support systems are available that implement Data Mining and Data Warehousing techniques for diving into the sea of data for getting useful patterns of knowledge (pearls). Classification, regression, clustering, and many…

Cryptography and Security · Computer Science 2024-03-01 Mohammad Khalid Imam Rahmani

The algebraic zigzag construction has recently been introduced as a combinatorial foundation for a higher dimensional notion of string diagram. For use in a proof assistant, a layout algorithm is required to determine the optimal rendering…

Category Theory · Mathematics 2024-02-21 Calin Tataru , Jamie Vicary

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…

Data Structures and Algorithms · Computer Science 2011-07-22 Hakob Aslanyan

This paper proposes a novel method that can replace compression-based dissimilarity measure (CDM) in composer estimation task. The main features of the proposed method are clarity and scalability. First, since the proposed method is…

Sound · Computer Science 2018-04-17 Ayaka Takamoto , Mitsuo Yoshida , Kyoji Umemura , Yuko Ichikawa

Meaning can be generated when information is related at a systemic level. Such a system can be an observer, but also a discourse, for example, operationalized as a set of documents. The measurement of semantics as similarity in patterns…

Computation and Language · Computer Science 2011-02-01 Loet Leydesdorff , Kasper Welbers

We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern…

Data Structures and Algorithms · Computer Science 2012-06-21 Gregory Kucherov , Yakov Nekrich , Tatiana Starikovskaya

We propose an $O(N\cdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we…

Machine Learning · Computer Science 2018-08-16 Hanqing Zhao , Yuehan Luo

In the realm of music AI, arranging rich and structured multi-track accompaniments from a simple lead sheet presents significant challenges. Such challenges include maintaining track cohesion, ensuring long-term coherence, and optimizing…

Sound · Computer Science 2024-11-26 Jingwei Zhao , Gus Xia , Ziyu Wang , Ye Wang

This paper describes an automatic word classification system which uses a locally optimal annealing algorithm and average class mutual information. A new word-class representation, the structural tag is introduced and its advantages for use…

cmp-lg · Computer Science 2008-02-03 John McMahon , F. J. Smith

A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.

Combinatorics · Mathematics 2007-05-23 George Parfionov , Roman Zapatrin
‹ Prev 1 3 4 5 6 7 10 Next ›