Results 71 to 80 of about 115,913 (217)
Variants of Constrained Longest Common Subsequence
, 2009 In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS).
Adi +23 more
core +1 more source
Mathematika, Volume 71, Issue 4, October 2025.Abstract Motivated by general probability theory, we say that the set S$S$ in Rd$\mathbb {R}^d$ is antipodal of rank k$k$, if for any k+1$k+1$ elements q1,…qk+1∈S$q_1,\ldots q_{k+1}\in S$, there is an affine map from convS$\mathrm{conv}\!\left(S\right)$ to the k$k$‐dimensional simplex Δk$\Delta _k$ that maps q1,…qk+1$q_1,\ldots q_{k+1}$ bijectively ...
Márton Naszódi +2 more
wiley +1 more source
Scalable and Sustainable Deep Learning via Randomized Hashing
, 2016 Current deep learning architectures are growing larger in order to learn from complex datasets. These architectures require giant matrix multiplication operations to train millions of parameters.
Chen Wenlin +8 more
core +1 more source
SECURITY AND PRIVACY, Volume 8, Issue 5, September/October 2025.ABSTRACT The increasing complexity and frequency of cyberattacks present significant challenges to Intrusion Detection Systems (IDS), mainly unknown (zero‐day) attacks. IDS are essential for safeguarding networks, but traditional systems struggle to detect unknown threats in dynamic and evolving network environments due to their reliance on predefined ...
Daniel Mourão Martins +2 more
wiley +1 more source
A Guide to Machine Learning Epistemic Ignorance, Hidden Paradoxes, and Other Tensions
WIREs Data Mining and Knowledge Discovery, Volume 15, Issue 3, September 2025.ABSTRACT Machine learning (ML) has rapidly scaled in capacity and complexity, yet blind spots persist beneath its high performance façade. In order to shed more light on this argument, this paper presents a curated catalogue of 175 unconventional concepts, each capturing a paradox, tension, or overlooked risk in modern ML practice.
M. Z. Naser
wiley +1 more source
Parallel Searching for a First Solution [PDF]
, 1993 A parallel algorithm for conducting a search for a first solution to the problem of generating minimal perfect hash functions is presented. A message-based distributed memory computer is assumed as a model for parallel computations.
Bartoszek, Bozena +2 more
core +1 more source
Antipode, Volume 57, Issue 5, Page 1892-1913, September 2025.Abstract This article examines the intersection of Asia's blockchain industry and special economic zones (SEZs). SEZs have been promoted to localise blockchain technology by disparate actors from cyberlibertarian figures to Asian blockchain firms, national policymakers, and local politicians.
Jamie Doucette, Seung‐Ook Lee
wiley +1 more source
Avoiding Rotated Bitboards with Direct Lookup [PDF]
, 2007 This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core
Concurrency and Computation: Practice and Experience, Volume 37, Issue 18-20, 30 August 2025.ABSTRACT E‐learning systems in an educational environment designed for wireless area networks for schools, universities, and research institutions provide consistency and better retention for students, professors, and researchers. An E‐learning system is known for storing lecture documents and live video conferences that are transmitted over public ...
Ahmed A. Mawgoud +4 more
wiley +1 more source
Factors Influencing the Binding of HIV‐1 Protease Inhibitors: Insights from Machine Learning Models
ChemMedChem, Volume 20, Issue 15, August 2, 2025.Machine learning unlocks the secrets of HIV‐1 protease inhibition, paving the way for data‐driven antiviral drug design. This study analyzes crystallographic data from hundreds of protein–ligand complexes, predicting ligand binding affinity with over 85% accuracy.
Yaffa Shalit, Inbal Tuvi‐Arad
wiley +1 more source