All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 31 of 31

Showing per page

Wildfires identification: Semantic segmentation using support vector machine classifier

Pecha, Marek, Langford, Zachary, Horák, David, Tran Mills, Richard (2023)

Programs and Algorithms of Numerical Mathematics

This paper deals with wildfire identification in the Alaska regions as a semantic segmentation task using support vector machine classifiers. Instead of colour information represented by means of BGR channels, we proceed with a normalized reflectance over 152 days so that such time series is assigned to each pixel. We compare models associated with 𝓁 1 -loss and 𝓁 2 -loss functions and stopping criteria based on a projected gradient and duality gap in the presented benchmarks.

Words over an ordered alphabet and suffix permutations

Jean-Pierre Duval, Arnaud Lefebvre (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w , we present in this article a linear time and space method to determine whether a word w ' has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly in linear...

Words over an ordered alphabet and suffix permutations

Jean-Pierre Duval, Arnaud Lefebvre (2010)

RAIRO - Theoretical Informatics and Applications

Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w, we present in this article a linear time and space method to determine whether a word w' has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word...

Workflow of Metadata Extraction from Retro-Born Digital Documents

Tkaczyk, Dominika, Bolikowski, Łukasz (2011)

Towards a Digital Mathematics Library. Bertinoro, Italy, July 20-21st, 2011

In this work-in-progress report we propose a workflow for metadata extraction from articles in a digital form. We decompose the problem into clearly defined sub-tasks and outline possible implementations of the sub-tasks. We report the progress of implementation and tests, and state future work.

WWW-based Boolean function minimization

Sebastian Tomaszewski, Ilgaz Celik, George Antoniou (2003)

International Journal of Applied Mathematics and Computer Science

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful...

Currently displaying 21 – 31 of 31

Previous Page 2