Peer-reviewed Articles - Computer sci

83 downloads
497 views

We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S(n−1)|) (where S(n−1) is the...

["Algorithms and Analysis of Algorithms","Data Science","Scientific Computing and Simulation"]
doi:10.7717/peerj-cs.153
99 downloads
616 views

Background Labels are a way to add some information on a text, such as functional annotations such as genes on a DNA sequences. V(D)J recombinations are DNA recombinations involving two or three short genes in lymphocytes. Sequencing this short region (500 bp or...

["Bioinformatics","Computational Biology","Algorithms and Analysis of Algorithms"]
doi:10.7717/peerj-cs.148
3 citations
419 downloads
1,652 views

Background Artificial neural networks (ANNs) are a robust class of machine learning models and are a frequent choice for solving classification problems. However, determining the structure of the ANNs is not trivial as a large number of weights (connection links)...

["Algorithms and Analysis of Algorithms","Artificial Intelligence","Data Mining and Machine Learning"]
doi:10.7717/peerj-cs.137
319 downloads
1,108 views

Timing Speculation (TS) is a widely known method for realizing better-than-worst-case systems. Aggressive clocking, realizable by TS, enable systems to operate beyond specified safe frequency limits to effectively exploit the data dependent circuit delay. However,...

["Algorithms and Analysis of Algorithms","Computer Architecture","Embedded Computing","Emerging Technologies"]
doi:10.7717/peerj-cs.79
1 citation
422 downloads
2,153 views

We describe a method for assessing data set complexity based on the estimation of the underlining probability distribution and Hellinger distance. In contrast to some popular complexity measures, it is not focused on the shape of a decision boundary in a classification...

["Algorithms and Analysis of Algorithms","Artificial Intelligence","Data Mining and Machine Learning"]
doi:10.7717/peerj-cs.76
2 citations
892 downloads
2,833 views

Edge preserving filters aim to simplify the representation of images (e.g., by reducing noise or eliminating irrelevant detail) while preserving their most significant edges. These filters are typically nonlinear and locally smooth the image structure while minimizing...

["Algorithms and Analysis of Algorithms","Computer Vision"]
doi:10.7717/peerj-cs.72
386 downloads
1,554 views

It is a well-known fact that some criminals follow perpetual methods of operations known as modi operandi. Modus operandi is a commonly used term to describe the habits in committing crimes. These modi operandi are used in relating criminals to crimes for which...

["Algorithms and Analysis of Algorithms","Artificial Intelligence","Data Mining and Machine Learning"]
doi:10.7717/peerj-cs.65
259 downloads
1,387 views

Identifying a temporal pattern of events is a fundamental task of online (real-time) verification. We present efficient schemes for online monitoring of events for identifying desired/undesired patterns of events. The schemes use preprocessing to ensure that the...

["Algorithms and Analysis of Algorithms","Theory and Formal Methods"]
doi:10.7717/peerj-cs.53
1 citation
480 downloads
1,576 views

Matrix Depot is a Julia software package that provides easy access to a large and diverse collection of test matrices. Its novelty is threefold. First, it is extensible by the user, and so can be adapted to include the user’s own test problems. In doing so, it...

["Algorithms and Analysis of Algorithms","Data Science","Scientific Computing and Simulation"]
doi:10.7717/peerj-cs.58
1 citation
1,398 downloads
16,391 views

We extend the existing enumeration of neck tie-knots to include tie-knots with a textured front, tied with the narrow end of a tie. These tie-knots have gained popularity in recent years, based on reconstructions of a costume detail from The Matrix Reloaded, and...

["Algorithms and Analysis of Algorithms","Computational Linguistics","Theory and Formal Methods"]
doi:10.7717/peerj-cs.2

Refine by manuscript type

Top subject areas - Articles

Top subject areas - People

View all subject areas