ﻻ يوجد ملخص باللغة العربية
We address the problem of which planar sets can be drawn with a pencil and eraser. The pencil draws any union of black open unit disks in the plane $mathbb{R}^2$. The eraser produces any union of white open unit disks. You may switch tools as many times as desired. Our main result is that drawability cannot be characterized by local obstructions: A bounded set can be locally drawable, while not being drawable. We also show that if drawable sets are defined using closed unit disks the cardinality of the collection of drawable sets is strictly larger compared with the definition involving open unit disks.
Intelligent agents can learn to represent the action spaces of other agents simply by observing them act. Such representations help agents quickly learn to predict the effects of their own actions on the environment and to plan complex action sequenc
We present a passive non-line-of-sight method that infers the number of people or activity of a person from the observation of a blank wall in an unknown room. Our technique analyzes complex imperceptible changes in indirect illumination in a video o
We describe the pitfalls encountered in deducing from classical double radio source observables (luminosity, spectral index, redshift and linear size) the essential nature of how these objects evolve. We discuss the key role played by hotspots in gov
Open-domain Question Answering models which directly leverage question-answer (QA) pairs, such as closed-book QA (CBQA) models and QA-pair retrievers, show promise in terms of speed and memory compared to conventional models which retrieve and read f
Learning effective representations of visual data that generalize to a variety of downstream tasks has been a long quest for computer vision. Most representation learning approaches rely solely on visual data such as images or videos. In this paper,