Results 21 to 30 of about 1,703,727 (282)
Multiple instance learning tracking method with local sparse representation
IET Computer Vision, 2013 When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them.
Chengjun Xie +4 more
doaj +1 more source
Backup or Not: An Online Cost Optimal Algorithm for Data Analysis Jobs Using Spot Instances
IEEE Access, 2020 Recently, large-scale public cloud providers begin to offer spot instances. This type of instance has become popular with more and more cloud users in the light of its convenient access mode and low price, especially for those big data analysis jobs with
Liduo Lin, Li Pan, Shijun Liu
doaj +1 more source
Online Algorithm Selection [PDF]
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017 Algorithm selection approaches have achieved impressive performance improvements in many areas of AI. Most of the literature considers the offline algorithm selection problem, where the initial selection model is never updated after training. However, new data from running algorithms on instances becomes available while an algorithm selection method is
openaire +1 more source
An Online Minorization-Maximization Algorithm
, 2023 AbstractModern statistical and machine learning settings often involve high data volume and data streaming, which require the development of online estimation algorithms. The online Expectation–Maximization (EM) algorithm extends the popular EM algorithm to this setting, via a stochastic approximation approach.We show that an online version of the ...
Nguyen, Hien +3 more
openaire +2 more sources
Virtual Network Embedding Algorithm for Location-Based Identifier Allocation
IEEE Access, 2019 Network virtualization allows multiple isolated virtual networks (VNs) to share the same substrate network (SN). VN embedding (VNE) algorithms can efficiently allocate the limited SN resources to VNs and assign a unique identifier to each VN.
Tianjiao Chen +4 more
doaj +1 more source
On the List Update Problem with Advice [PDF]
, 2016 We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives partial information about the unknown parts of the input in the form of some bits of advice generated by a benevolent offline ...
Boyar, Joan +3 more
core +3 more sources
Online Disjoint Set Cover Without Prior Knowledge [PDF]
, 2019 The disjoint set cover (DSC) problem is a fundamental combinatorial optimization problem concerned with partitioning the (hyper)edges of a hypergraph into (pairwise disjoint) clusters so that the number of clusters that cover all nodes is maximized.
Emek, Yuval +2 more
core +1 more source
Online Bi-Criteria Scheduling on Batch Machines with Machine Costs
Mathematics, 2019 We consider online scheduling with bi-criteria on parallel batch machines, where the batch capacity is unbounded. In this paper, online means that jobs’ arrival is over time.
Wenhua Li, Weina Zhai, Xing Chai
doaj +1 more source
An Online Algorithm for Smoothed Online Convex Optimization [PDF]
ACM SIGMETRICS Performance Evaluation Review, 2019 We consider Online Convex Optimization (OCO) in the setting where the costs are m-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive ratio 3+O(1/m), irrespective of the ...
Goel, Gautam, Wierman, Adam
openaire +2 more sources
First-Come-First-Served for Online Slot Allocation and Huffman Coding [PDF]
, 2013 Can one choose a good Huffman code on the fly, without knowing the underlying distribution? Online Slot Allocation (OSA) models this and similar problems: There are n slots, each with a known cost. There are n items.
Khare, Monik +2 more
core +2 more sources