arxiv.org/abs/2407.04255v1
In this paper, we present our solution for the WSDM2023 Toloka Visual Question Answering Challenge. Inspired by the application of multimodal pre-trained models to various downstream tasks(e.g., visual question answering, visual grounding, and cross-...
arxiv.org/abs/1204.5490v1
This paper solves a pursuit-evasion problem in which a prince must find a princess who is constrained to move on each day from one vertex of a finite graph to another. Unlike the related and much studied `Cops and Robbers Game', the prince has no kno...
arxiv.org/abs/2203.11842v1
Inverse Reinforcement Learning (IRL) is a powerful way of learning from demonstrations. In this paper, we address IRL problems with the availability of prior knowledge that optimal policies will never violate certain constraints. Conventional approac...
arxiv.org/abs/1408.5316v1
Cuckoo search (CS) is a relatively new algorithm, developed by Yang and Deb in 2009, and CS is efficient in solving global optimization problems. In this paper, we review the fundamental ideas of cuckoo search and the latest developments as well as i...
arxiv.org/abs/1003.1594v1
In this paper, we intend to formulate a new metaheuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Levy f...
arxiv.org/abs/1408.5343v1
Cuckoo search (CS) was introduced in 2009, and it has attracted great attention due to its promising efficiency in solving many optimization problems and real-world applications. In the last few years, many papers have been published regarding cuckoo...
arxiv.org/abs/1810.02941v2
This paper provides a conceptual study of the twisting procedure, which amounts to create functorially new differential graded Lie algebras, associative algebras or operads (as well as their homotopy versions) from a Maurer--Cartan element. On the wa...
arxiv.org/abs/1509.03904v1
In this paper we propose a general class of models for spreading processes we call the $SI^*V^*$ model. Unlike many works that consider a fixed number of compartmental states, we allow an arbitrary number of states on arbitrary graphs with heterogene...
arxiv.org/abs/1707.00742v6
In this paper, we develop a robust economic model predictive controller for the containment of stochastic Susceptible-Exposed-Infected-Vigilant (SEIV) epidemic processes which drives the process to extinction quickly, while minimizing the rate at whi...
arxiv.org/abs/2511.10541v1
In this paper, we extend the result of arXiv:2409.13662 by showing that the set on which every pseudotangent is obtained on a Lipschitz curve can be any compact, uniformly disconnected set in Euclidean space which admits any Lipschitz capture. We do...
arxiv.org/abs/2308.11971v2
Building scalable vision-language models to learn from diverse, multimodal data remains an open challenge. In this paper, we introduce an Efficient Vision-languagE foundation model, namely EVE, which is one unified multimodal Transformer pre-trained...
arxiv.org/abs/2309.01461v1
Vehicular control systems are required to be both extremely reliable and robust to different environmental conditions, e.g. load or tire-road friction. In this paper, we extend a new paradigm for state estimation, called Twin-in-the-Loop filtering (T...
arxiv.org/abs/2104.12675v2
In this paper, we present our system design for conducting longitudinal daily-task studies with the same workers throughout on Amazon Mechanical Turk. We implement this system to conduct a study into touch dynamics, and present our experiences, chall...
arxiv.org/abs/1410.5491v1
Building machine translation (MT) test sets is a relatively expensive task. As MT becomes increasingly desired for more and more language pairs and more and more domains, it becomes necessary to build test sets for each case. In this paper, we invest...
arxiv.org/abs/1609.00515v1
A set of vertices in a graph is called independent if no two vertices of the set are connected by an edge. In this paper we use the state matrix recursion algorithm, developed by Oh, to enumerate independent vertex sets in a grid graph and even furth...
arxiv.org/abs/2008.01155v2
This ia a companion paper to Almost, Lehoczky, Shreve & Yu \cite{ALSY}, where the rationale for studying the diffusion limit of Poisson limit-order book models is explained and the results of a particular "representative" model are detailed. This pap...
arxiv.org/abs/1107.4988v1
In this paper we discuss the recently discovered radio transient in the nuclear region of M\,82. It has been suggested that this source is an X-ray binary, which, given the radio flux density, would require an X-ray luminosity, $L_{\rm X}\,\sim6\time...
arxiv.org/abs/1801.06258v1
This paper addresses the Data-Diff problem: given a dataset and a subsequent version of the dataset, find the shortest sequence of operations that transforms the dataset to the subsequent version, under a restricted family of operations. We consider...
arxiv.org/abs/alg-geom/9701002v1
This is the continuation of papers by Braun and Floystad, Cook, Braun and Cook. We use Generic Initial Ideal Theory in conjunction with Liaison Theory to further restrict the possible generic initial ideals of hyperplane sections of smooth surfaces...
arxiv.org/abs/physics/0601103v1
The ILC beam dumps are a key part of the accelerator design. At Snowmass 2005, the current status of the beam dump designs were reviewed, and the options for the overall dump layout considered. This paper describes the available dump options for th...