Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Fusing partial estimates is a critical and common problem
in many computer vision tasks such as part-based detection
and tracking. It generally becomes complicated and
intractab...