English
Related papers

Related papers: A Set Automaton to Locate All Pattern Matches in a…

200 papers

In this paper, we proposed a deep learning-based end-to-end method on the domain specified automatic term extraction (ATE), it considers possible term spans within a fixed length in the sentence and predicts them whether they can be…

Computation and Language · Computer Science 2019-09-10 Yuze Gao , Yu Yuan

In this paper we propose a novel approach to identify dynamical systems. The method estimates the model structure and the parameters of the model simultaneously, automating the critical decisions involved in identification such as model…

Systems and Control · Computer Science 2020-01-16 Dhruv Khandelwal , Maarten Schoukens , Roland Tóth

An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular language. In this paper, we solve the long-standing problem of…

Data Structures and Algorithms · Computer Science 2020-07-16 Nicola Cotumaccio , Nicola Prezza

Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., linear chains) in which search and parameter estimation can be…

Machine Learning · Computer Science 2009-07-07 Hal Daumé , Daniel Marcu

A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…

Optimization and Control · Mathematics 2018-06-25 Johanna A. Frau , Elvio A. Pilotta

Education systems are dynamically changing to accommodate technological advances, industrial and societal needs, and to enhance students' learning journeys. Curriculum specialists and educators constantly revise taught subjects across…

Computers and Society · Computer Science 2024-03-12 Tamador Alkhidir , Edmond Awad , Aamena Alshamsi

Definition modeling is an important task in advanced natural language applications such as understanding and conversation. Since its introduction, it focus on generating one definition for a target word or phrase in a given context, which…

Computation and Language · Computer Science 2023-05-25 Linhan Zhang , Qian Chen , Wen Wang , Yuxin Jiang , Bing Li , Wei Wang , Xin Cao

In this work, we tackle a natural variation of the String Matching Problem on the case of a dynamic pattern, that is, given a static text $T$ and a pattern $P$, we want to support character additions and deletions to the pattern, and after…

Data Structures and Algorithms · Computer Science 2025-06-16 Bruno Monteiro , Vinicius dos Santos

Image matching is a key component of many tasks in computer vision and its main objective is to find correspondences between features extracted from different natural images. When images are represented as graphs, image matching boils down…

Computer Vision and Pattern Recognition · Computer Science 2022-05-31 Nancy Xu , Giannis Nikolentzos , Michalis Vazirgiannis , Henrik Boström

In this paper we describe a new method for detecting and counting a repeating object in an image. While the method relies on a fairly sophisticated deformable part model, unlike existing techniques it estimates the model parameters in an…

Computer Vision and Pattern Recognition · Computer Science 2019-04-16 Inbar Huberman , Raanan Fattal

We propose a batchwise monotone algorithm for dictionary learning. Unlike the state-of-the-art dictionary learning algorithms which impose sparsity constraints on a sample-by-sample basis, we instead treat the samples as a batch, and impose…

Machine Learning · Computer Science 2015-02-03 Huan Wang , John Wright , Daniel Spielman

Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.

Formal Languages and Automata Theory · Computer Science 2021-06-02 Artur Polański , Eryk Lipka

Finite-state tree automata are a well studied formalism for representing term languages. This paper studies the problem of determining the regularity of the set of instances of a finite set of terms with variables, where each variable is…

Symbolic Computation · Computer Science 2009-11-20 Omer Giménez , Guillem Godoy , Sebastian Maneth

We address the problem of predicting similarity between a pair of handwritten document images written by different individuals. This has applications related to matching and mining in image collections containing handwritten content. A…

Computer Vision and Pattern Recognition · Computer Science 2016-05-20 Praveen Krishnan , C. V. Jawahar

Data mining is the practice to search large amount of data to discover data patterns. Data mining uses mathematical algorithms to group the data and evaluate the future events. Association rule is a research area in the field of knowledge…

Databases · Computer Science 2013-02-08 Jnanamurthy H. K.

We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and…

Data Structures and Algorithms · Computer Science 2018-03-28 Pedro F. Felzenszwalb

We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report each time some string in our dictionary occurs in the…

Data Structures and Algorithms · Computer Science 2015-04-24 Raphael Clifford , Allyx Fontaine , Ely Porat , Benjamin Sach , Tatiana Starikovskaya

Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential…

Information Retrieval · Computer Science 2021-09-15 Christian Hansen

Automatic Word problem solving has always posed a great challenge for the NLP community. Usually a word problem is a narrative comprising of a few sentences and a question is asked about a quantity referred in the sentences. Solving word…

Computation and Language · Computer Science 2018-08-10 Pruthwik Mishra , Litton J Kurisinkel , Dipti Misra Sharma

Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework…

Logic in Computer Science · Computer Science 2015-10-30 Anthony W. Lin , Truong Khanh Nguyen , Philipp Rümmer , Jun Sun
‹ Prev 1 8 9 10 Next ›