Related papers: Solving the subset-sum problem with a light-based …

A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the position of the first vertex that hits it, and the objective is to…

We present a new object representation, called Dense RepPoints, that utilizes a large set of points to describe an object at multiple levels, including both box level and pixel level. Techniques are proposed to efficiently process these…

This paper presents algorithms for the included-sums and excluded-sums problems used by scientific computing applications such as the fast multipole method. These problems are defined in terms of a $d$-dimensional array of $N$ elements and…

We propose a method for the computation of a consistent system matrix for two- and three-dimensional cone-beam computed tomography (CT). The method relies on the decomposition of the cone-voxel intersection volumes into subvolumes that…

We consider the following geometric optics problem: Construct a system of two reflectors which transforms a spherical wavefront generated by a point source into a beam of parallel rays. This beam has a prescribed intensity distribution. We…

This paper proposes a novel algorithm for the problem of structural image segmentation through an interactive model-based approach. Interaction is expressed in the model creation, which is done according to user traces drawn over a given…

We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…

This work develops novel algorithms for high-performance networking in the presence of obstacles based on a method for communicating via ultrasonic rays reflected at the obstacles. The rays are curves determined by the variable speed of…

In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem). We have developed an efficient algorithm for light spanners in bounded pathwidth graphs, based…

Real-world graphs can be difficult to interpret and visualize beyond a certain size. To address this issue, graph summarization aims to simplify and shrink a graph, while maintaining its high-level structure and characteristics. Most…

This paper addresses the problem of video summarization. Given an input video, the goal is to select a subset of the frames to create a summary video that optimally captures the important information of the input video. With the large…

Designing freeform surfaces to control light based on real-world illumination patterns is challenging, as existing caustic lens designs often assume oversimplified point or parallel light sources. We propose representing surface light…

We study numerical methods of tomography in domains with a reflecting obstacle. It will be shown that tomography with sets containing both broken rays, i.e. rays reflecting at the obstacle, as well as unbroken rays, has a smaller error…

Energy-efficient computing is becoming increasingly important in the information era. However, electronic computers with von Neumann architecture can hardly meet the challenge due to the inevitable energy-intensive data movement, especially…

Linear spectral unmixing under nonnegativity and sum-to-one constraints is a convex optimization problem for which many algorithms were proposed. In practice, especially for supervised unmixing (i.e., with a large dictionary), solutions…

Gravitationally lensed sources may have unresolved or blended multiple images, and for time varying sources the lightcurves from individual images can overlap. We use convolutional neural nets to both classify the lightcurves as due to…

Using well-known mathematical problems for encryption is a widely used technique because they are computationally hard and provide security against potential attacks on the encryption method. The subset sum problem (SSP) can be defined as…

In this paper, we describe a graph-based algorithm that uses the features obtained by a self-supervised transformer to detect and segment salient objects in images and videos. With this approach, the image patches that compose an image or…

Computer vision applications such as visual relationship detection and human object interaction can be formulated as a composite (structured) set detection problem in which both the parts (subject, object, and predicate) and the sum…

Generating realistic shadows for inserted objects requires reasoning about scene geometry and illumination. However, most existing methods operate purely in image space, leaving the physical relationship between objects, lighting, and…