We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...