Results 41 to 50 of about 1,801,338 (187)
Future TransportationVehicle ride-sharing commute in smart cities is a service that has changed the way of citizens’ daily life and transportation schedule. Research in vehicle ride sharing aims to provide passengers with a comfortable living and well-being within the city ...
Theodoros Anagnostopoulos +1 more
doaj +1 more source
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
, 2015 Computing problems that handle large amounts of data necessitate the use of lossless data compression for efficient storage and transmission. We present a novel lossless universal data compression algorithm that uses parallel computational units to ...
Baron, Dror, Krishnan, Nikhil
core +1 more source
Algorithms for learning parsimonious context trees [PDF]
Machine Learning, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ralf Eggeling +2 more
openaire +2 more sources
Modal µ-Calculus, Model Checking and Gauß Elimination [PDF]
, 1995 In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauß elimination for linear
Mader, Angelika
core +4 more sources
Vision-Based Flying Targets Detection via Spatiotemporal Context Fusion
IEEE Access, 2019 Deriving from the imperative necessities for developing Sense and Avoid (SAA) capability of Unmanned Aerial Vehicle (UAV), a newly designed flying targets detection algorithm is presented in this paper for enhancing the UAV environment perception ability.
Yunfeng Cao +4 more
doaj +1 more source
Adaptive Alternating Minimization Algorithms [PDF]
, 2008 The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many areas such as
Niesen, Urs +2 more
core +3 more sources
Nonparametric Stochastic Contextual Bandits
, 2018 We analyze the $K$-armed bandit problem where the reward for each arm is a noisy realization based on an observed context under mild nonparametric assumptions.
Guan, Melody Y., Jiang, Heinrich
core +1 more source
Optimal alignment algorithm for context-sensitive hidden Markov models [PDF]
, 2005 The hidden Markov model is well-known for its efficiency in modeling short-term dependencies between adjacent samples. However, it cannot be used for modeling longer-range interactions between symbols that are distant from each other.
Vaidyanathan, P. P., Yoon, Byung-Jun
core +1 more source
Synthesizing Program Input Grammars
, 2017 We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program.
Albarghouthi A. +14 more
core +1 more source
Finding low-weight polynomial multiples using discrete logarithm [PDF]
, 2007 Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off.
Domaine De Voluceau +3 more
core +5 more sources