Search
Search Results
-
Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity
Submodular maximization is a NP-hard combinatorial optimization problem regularly used in machine learning and data mining with large-scale data...
-
Query-Driven Verification of Data Integration in the RDF Data Model
AbstractMethods and tools for data integration are very important for problem solving in research infrastructures supporting the FAIR data management...
-
Active learning by query by committee with robust divergences
Active learning is a widely used methodology for various problems with high measurement costs. In active learning, the next object to be measured is...
-
KATKA: A KRAKEN-Like Tool with k Given at Query Time
We describe a new tool, KATKA, that stores a phylogenetic tree T such that later, given a pattern P[1..m] and an integer k, it can quickly return the...
-
Data source selection for approximate query
Exact query on big data is a challenging task due to the large numbers of autonomous data sources. In this paper, an efficient method is proposed to...
-
Time Efficient Implementation for Online K-Server Problem on Trees
We consider online algorithms for the k-server problem on trees of size n. Chrobak and Larmore proposed a k-competitive algorithm for this problem...
-
A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities
Consider a collection of entities moving with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach...
-
Text Matching as Time Series Matching
Text matching plays a fundamental and vital role in many aspects of natural language processing (NLP), where multi-level text matching is the most...
-
-
Sublinear Time Lempel-Ziv (LZ77) Factorization
The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that plays a central role in data compression and indexing. For a...
-
The Reduced Basis Method in Space and Time: Challenges, Limits and Perspectives
The simulation and optimization of several real-world industrial problems involve parameters, e.g. unknown constants, design parameters, controls...
-
Intersecting and dense restrictions of clutters in polynomial time
A clutter is a family of sets, called members, such that no member contains another. It is called intersecting if every two members intersect, but...
-
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to...
-
A Dynamic Mode Decomposition Based Reduced-Order Model For Parameterized Time-Dependent Partial Differential Equations
We propose a reduced-order model (ROM) based on dynamic mode decomposition (DMD) for efficient reduced-order modeling of parameterized time-dependent...
-
Quantum First-Order Logics that Capture Logarithmic-Time/Space Quantum Computability
We introduce a quantum analogue of classical first-order logic (FO) and develop a theory of quantum first-order logic (QFO) as a basis of the...
-
Cooperation in combinatorial search
In the game theoretical approach of the basic problem in Combinatorial Search an adversary thinks of a defective element d of an n -element pool X ,...
-
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences....
-
Physics-Based Active Learning for Design Space Exploration and Surrogate Construction for Multiparametric Optimization
The sampling of the training data is a bottleneck in the development of artificial intelligence (AI) models due to the processing of huge amounts of...
-
Development and validation of the early warning system scores ontology
BackgroundClinical early warning scoring systems, have improved patient outcomes in a range of specializations and global contexts. These systems are...
-
Non-overlap** Indexing in BWT-Runs Bounded Space
We revisit the non-overlap** indexing problem for an efficient repetition-aware solution. The problem is to index a text T[1..n], such that...