Results 21 to 30 of about 274,129 (290)
Novel Algorithms for Graph Clustering Applied to Human Activities
Mathematics, 2021 In this paper, a novel algorithm (IBC1) for graph clustering with no prior assumption of the number of clusters is introduced. Furthermore, an additional algorithm (IBC2) for graph clustering when the number of clusters is given beforehand is presented ...
Nebojsa Budimirovic, Nebojsa Bacanin
doaj +1 more source
Computational Dynamics of a 3D Elastic String Pendulum Attached to a Rigid Body and an Inertially Fixed Reel Mechanism [PDF]
, 2009 A high fidelity model is developed for an elastic string pendulum, one end of which is attached to a rigid body while the other end is attached to an inertially fixed reel mechanism which allows the unstretched length of the string to be dynamically ...
Lee, Taeyoung +2 more
core +5 more sources
Tube-Based Taut String Algorithms for Total Variation Regularization
Mathematics, 2020 Removing noise from signals using total variation regularization is a challenging signal processing problem arising in many practical applications.
Artyom Makovetskii +3 more
doaj +1 more source
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
Algorithms for Molecular Biology, 2020 Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings.
Felipe A. Louza +4 more
doaj +1 more source
String correction using the Damerau-Levenshtein distance
BMC Bioinformatics, 2019 Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution ...
Chunchun Zhao, Sartaj Sahni
doaj +1 more source
Multiresolution vector quantization [PDF]
, 2004 Multiresolution source codes are data compression algorithms yielding embedded source descriptions. The decoder of a multiresolution code can build a source reproduction by decoding the embedded bit stream in part or in whole.
Dugatkin, Diego, Effros, Michelle
core +2 more sources
Entropy-Based Approach in Selection Exact String-Matching Algorithms
Entropy, 2020 The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case.
Ivan Markić +3 more
doaj +1 more source
A New Search Algorithm for Feature Selection in Hyperspectral Remote Sensing Images [PDF]
, 2001 A new suboptimal search strategy suitable for feature selection in very high-dimensional remote-sensing images (e.g. those acquired by hyperspectral sensors) is proposed.
Bruzzone, Lorenzo +1 more
core +2 more sources
Improving database quality through eliminating duplicate records
Data Science Journal, 2006 Redundant or duplicate data are the most troublesome problem in database management and applications. Approximate field matching is the key solution to resolve the problem by identifying semantically equivalent string values in syntactically different ...
Mingzhen Wei +2 more
doaj +1 more source
Practical Evaluation of Lyndon Factors via Alphabet Reordering
Mathematics, 2022 We evaluate the influence of different alphabet orderings on the Lyndon factorization of a string. Experiments with Pizza&Chili datasets show that for most alphabet reorderings, the number of Lyndon factors is usually small, and the length of the longest
Marcelo K. Albertini, Felipe A. Louza
doaj +1 more source